Colloque | Computability, Algorithms, Types and Proofs

Organisation : Jean-Baptiste Joinet - jean-baptiste.joinet@univ-lyon3.fr

Monday 22/11 - Salle ROTONDE, 18 rue Chevreul 69007 Lyon
 

• 14:30-15:45 : Tito MARQUES PALMEIRO. UERJ, Rio de Janeiro, Departamento de Filosofia
  "About the equivalence which defines the central “thesis” of computability theory: recursive functions, lambda-calculus and computatibility"
   
• 16:00-17:15 : Jean-Baptiste JOINET. Univ. Jean Moulin Lyon 3, IRPhiL & IHPST (CNRS, univ. Paris 1)
  "The essentialist and the existentialist approaches of the notion of type"

Tuesday 23/11 - Amphi HUVELIN, 15 quai Claude Bernard, 69007 Lyon
 

• 09:45-11:00 : Carlos OLARTE LIPN, Université Sorbonne Paris Nord
  "A subexponential view of domains in session types (joint work with Daniele Nantes and Daniel Ventura)"
   
• 11:15-12:30 : Paolo PISTONE. Universitá di Bologna
  "Towards Logical Foundations for Randomized Computability (joint work with Melissa Antonelli and Ugo Dal Lago)"
   
• 14:45-16:00 : Hermann HAUESLER. PUC-Rio de Janeiro
  "About Hypercomputation and the physical Turing-Church thesis"
   
• 16:15-17:30 : Walter DEAN. University of Warwick. Department of Philosophy
  "Algorithms and Ontology"

Wednesday 24/11 - Salle ROTONDE, 18 rue Chevreul 69007 Lyon
 

• 10:00-11:15 : Luiz Carlos PEREIRA. PUC-Rio de Janeiro
  "About Ex falso quodlibet and Disjunctive Syllogism"
   
• 11:15-12:30 : Elaine PIMENTEL. Université Sorbonne Paris-Nord
  "Ecumenical modal logic"

Supported by: IRPhiL (univ. Jean Moulin Lyon 3); Programme “Philosophie & Informatique : interactions contemporaines” (Action Capes-Cofecub Sh-873 17); Programme “Abstraction & Classification: Computation & Types” (Bourgeon, univ. Jean Moulin Lyon 3).