An overview of Structural Proof Theory and Computing

Dale Miller

Description

Niveau: Supérieur
An overview of Structural Proof Theory and Computing Dale Miller INRIA-Saclay & LIX, Ecole Polytechnique Palaiseau, France Madison, Wisconsin, 2 April 2012 Part of the Special Session in Structural Proof Theory and Computing 2012 ASL annual meeting

• dale miller


• proof normalization


• modal logics


• functional programming


• proof complexity


• itu copenhagen


• structural proof


• computation


• sequent calculus

Sujets

• Computation
• Philippus Baldaeus
• Isomorphism
• École polytechnique
• University of Vienna
• Saurin
• Dale Miller
• Functional Programming
• Proof complexity

Informations

• Publié par: chaeh
• Nombre de lectures: 14
• Langue: English

Extrait

Anoverviewof StructuralProofTheoryandComputing DaleMiller INRIA-Saclay&LIX,E ´ colePolytechnique Palaiseau,France Madison,Wisconsin,2April2012 Partofthe SpecialSessioninStructuralProofTheoryandComputing 2012ASLannualmeeting

Outline Settingtehegats Overviewofsequent Focusedfoorp calculus systems