Herbelin, Hugo - INRIA Paris-Rocquencourt

• Game Semantics & Abstract Machines CNRSUniversite Paris 7
• Atranslation and Looping Combinators in Pure Type Thierry Coquand, coquand@cs.chalmers.se
• Forcing-based cut-elimination for Gentzen-style intuitionistic sequent calculus
• (author's version of the work not for redistribution) An Approach to Call-by-Name Delimited Continuations
• THESE DE DOCTORAT pr'esent'ee
• A calculus Structure Isomorphic to Gentzenstyle Sequent Calculus Structure
• Equality is typable in Semi-Full Pure Type Systems Vincent Siles
• A New Elimination Rule for the Calculus of Inductive Constructions
• Duality of computation and sequent calculus: a few more remarks Hugo Herbelin
• The Duality of Computation PierreLouis Curien
• HABILITATION DIRIGER LES RECHERCHES L'UNIVERSIT PARIS 11
• -calculus and -calculus: a Capital Difference
• Type inference with algebraic universes in the Calculus of Inductive Constructions
• Le th'eor`eme de SchroederBernstein
• An Intuitionistic Logic That Proves Markov's Principle Hugo Herbelin
• ESPRIT Basic Research Action 6453 TYPES: Types for Proofs and Programs
• A TypeTheoretic Foundation of Delimited Continuations +
• Extraction de progamme `a partir de preuves de la logique classique
• A ProofTheoretic Foundation of Abortive Continuations +
• On the Degeneracy of -Types in Presence of Computational Classical Logic
• We consider reducibility sets de ned not by induction on types but by induction on sequents as a tool to prove strong normalisation of systems with explicit substitution. To illustrate
• The duality of computation (notes for the 3rd International Workshop on Higher-Order Rewriting)
• A constructive proof of dependent choice, compatible with classical logic
• A ~-calculus structure isomorphic to sequent calculus structure DRAFT
• Weak cut-elimination and the game-theoretic approach of Novikoff's provability
• Notes sur les ~oe-calculs 1 Un ~AE-calcul avec noms
• Some remarks on Novikoff's calculus Thierry Coquand, Hugo Herbelin
• Projet de Langage Fonctionnel `a rendre le 14 janvier 1994
• A TypeTheoretic Foundation of Continuations and Prompts
• D'ebat et 'elimination faible de tete 84 CHAPITRE 6. D '
• Under consideration for publication in J. Functional Programming 1 Control Reduction Theories
• Difficult'es conceptuelles dans l'enseignement du C
• Weak reduction in sequent calculus Draft version
• Arity-controlled reduction in type systems DRAFT
• Compilation de Mini-Scheme/Mini-ML en instructions pour une machine `a environnement
• ZU064-05-FPR PTSATR 14 November 2011 9:42 Under consideration for publication in J. Functional Programming 1
• Classical Call-by-need and duality Zena M. Ariola1