Hugo Herbelin

发表

The Coq proof assistant : reference manual, version 6.1

Hugo Herbelin, Jean-Christophe Filliâtre, Cristina Cornes, 1997 .

Type inference with algebraic universes in the Calculus of Inductive Constructions

Hugo Herbelin, 2005 .

On the Degeneracy of Σ-Types in Presence of Computational Classical Logic

Hugo Herbelin, Hugo Herbelin, 2005 .

Coq 8.4 Reference Manual

Benjamin Grégoire, Enrico Tassi, Yann Régis-Gianas, 2014 .

Duality of computation and sequent calculus : a few more remarks

Hugo Herbelin, 2008 .

An Operational Account of Call-By-Value Minimal and Classical λ-calculus in “ Natural Deduction ” Form ( revision fixing a few errors – January 2010 )

Hugo Herbelin, Stéphane Zimmermann, 2009 .

Classical Call-by-need and duality , extended version ?

Z. M. Ariola, Hugo Herbelin, A. Saurin, 2011 .

Computing with Abstract Böhm Trees

Hugo Herbelin, Pierre-Louis Curien, Hugo Herbelin, 1998, Fuji International Symposium on Functional and Logic Programming.

A Proof-Theoretic Foundation of Abortive Continuations ( Extended version ) by

Z. M. Ariola, A. Sabry, Hugo Herbelin, 2005 .

A calculus of expandable stores

Hugo Herbelin, 2020 .

New Results - Development of systems

Jean-Pierre Jouannaud, Pierre-Yves Strub, César Muñoz, 2006 .

The Coq proof assistant user's guide : version 5.6

Amy P. Felty, Hugo Herbelin, Christine Paulin-Mohring, 1990 .

Sub-extensional type theory

Hugo Herbelin, 2015 .

A continuation-passing-style interpretation of simply-typed call-by-need λ-calculus with control within System F

Hugo Herbelin, Étienne Miquey, 2016 .

An Operational Account of Call-by-Value Minimal and Classical lambda-Calculus in "Natural Deduction" Form

Hugo Herbelin, Stéphane Zimmermann, 2009, TLCA.

The duality of computation

Hugo Herbelin, Pierre-Louis Curien, Hugo Herbelin, 2000, ICFP '00.

AN ANALYSIS OF THE CONSTRUCTIVE CONTENT OF HENKIN’S PROOF OF GÖDEL’S COMPLETENESS THEOREM

Hugo Herbelin, Danko Ilik, Hugo Herbelin, 2016 .

Classical Call-by-Need and Duality

Alexis Saurin, Hugo Herbelin, Zena M. Ariola, 2011, TLCA.

An Intuitionistic Logic that Proves Markov's Principle

Hugo Herbelin, Hugo Herbelin, 2010, 2010 25th Annual IEEE Symposium on Logic in Computer Science.

A type-theoretic foundation of delimited continuations

Amr Sabry, Hugo Herbelin, Zena M. Ariola, 2009, High. Order Symb. Comput..

A proof-theoretic foundation of abortive continuations

Amr Sabry, Hugo Herbelin, Zena M. Ariola, 2007, High. Order Symb. Comput..

On the Degeneracy of Sigma-Types in Presence of Computational Classical Logic

Hugo Herbelin, Hugo Herbelin, 2005, TLCA.

Minimal Classical Logic and Control Operators

Hugo Herbelin, Zena M. Ariola, Z. M. Ariola, 2003, ICALP.

Explicit Substitutions and Reducibility

Hugo Herbelin, 2001, J. Log. Comput..

A Lambda-Calculus Structure Isomorphic to Gentzen-Style Sequent Calculus Structure

Hugo Herbelin, Hugo Herbelin, 1994, CSL.

30 years of research and development around Coq

Hugo Herbelin, Gérard P. Huet, G. Huet, 2014, POPL.

Realizability Interpretation and Normalization of Typed Call-by-Need \lambda -calculus with Control

Hugo Herbelin, Étienne Miquey, Hugo Herbelin, 2018, FoSSaCS.

Realizability Interpretation and Normalization of Typed Call-by-Need λ-calculus With Control pdf

Hugo Herbelin, Étienne Miquey, Hugo Herbelin, 2018, ArXiv.

A type-theoretic foundation of continuations and prompts

Amr Sabry, Hugo Herbelin, Zena M. Ariola, 2004, ICFP '04.

Classical Call-by-Need and Duality

Hugo Herbelin, A. Saurin, Z. Ariola, 2011, TLCA.

Forcing-Based Cut-Elimination for Gentzen-Style Intuitionistic Sequent Calculus

Hugo Herbelin, Gyesik Lee, Hugo Herbelin, 2009, WoLLIC.

New Observations on the Constructive Content of First-Order Completeness Theorems

Dominik Kirst, Hugo Herbelin, 2023 .

The Unity of Semantic Artifacts

Hugo Herbelin, Keiko Nakata, A. Saurin, 2012 .

Kripke models for classical logic pdf

Hugo Herbelin, Gyesik Lee, Danko Ilik, 2009, Ann. Pure Appl. Log..

An analysis of the constructive content of Henkin's proof of G\"odel's completeness theorem

Hugo Herbelin, Danko Ilik, 2024, 2401.13304.

The 2006 Federated Logic Conference Strategies 2006: 6th International Workshop on Strategies in Automated Deduction Conference Organization Programme Chairs Programme Committee External Reviewers Internal Deduction and Decision Procedures of the 4-colour Theorem Session 1. Regular Papers Session 2.

Georges Gonthier, J. Meseguer, S. Owre, 2006 .

An approach to call-by-name delimited continuations

Hugo Herbelin, Silvia Ghilezan, Hugo Herbelin, 2008, POPL '08.

Game semantics and abstract machines

Vincent Danos, Hugo Herbelin, Laurent Regnier, 1996, Proceedings 11th Annual IEEE Symposium on Logic in Computer Science.