Hugo Herbelin

Vincent Siles, Hugo Herbelin: Pure Type System conversion is always typable. J. Funct. Program. 22(2): 153-180 (2012)

Zena M. Ariola, Paul Downen, Hugo Herbelin, Keiko Nakata, Alexis Saurin: Classical Call-by-Need Sequent Calculi: The Unity of Semantic Artifacts. FLOPS 2012: 32-46

Hugo Herbelin: A Constructive Proof of Dependent Choice, Compatible with Classical Logic. LICS 2012: 365-374

Zena M. Ariola, Hugo Herbelin, Alexis Saurin: Classical Call-by-Need and Duality. TLCA 2011: 27-44

Danko Ilik, Gyesik Lee, Hugo Herbelin: Kripke models for classical logic. Ann. Pure Appl. Logic 161(11): 1367-1378 (2010)

Vincent Siles, Hugo Herbelin: Equality Is Typable in Semi-full Pure Type Systems. LICS 2010: 21-30

Hugo Herbelin: An Intuitionistic Logic that Proves Markov's Principle. LICS 2010: 50-56

Zena M. Ariola, Hugo Herbelin, Amr Sabry: A type-theoretic foundation of delimited continuations. Higher-Order and Symbolic Computation 22(3): 233-273 (2009)

Jim Allen, Zena M. Ariola, Pierre-Louis Curien, Matthew Fluet, Jeff Foster, Dan Grossman, Robert Harper, Hugo Herbelin, Yannis Smaragdakis, David Walker, Steve Zdancewic: An overview of the Oregon programming languages summer school. SIGPLAN Notices 44(11): 1-3 (2009)

Hugo Herbelin, Stéphane Zimmermann: An Operational Account of Call-by-Value Minimal and Classical lambda-Calculus in "Natural Deduction" Form. TLCA 2009: 142-156

Hugo Herbelin, Gyesik Lee: Forcing-Based Cut-Elimination for Gentzen-Style Intuitionistic Sequent Calculus. WoLLIC 2009: 209-217

Danko Ilik, Gyesik Lee, Hugo Herbelin: Kripke Models for Classical Logic. CoRR abs/0904.0071 (2009)

Zena M. Ariola, Hugo Herbelin: Control reduction theories: the benefit of structural substitution. J. Funct. Program. 18(3): 373-419 (2008)

Hugo Herbelin, Silvia Ghilezan: An approach to call-by-name delimited continuations. POPL 2008: 383-394

Bruno Barras, Pierre Corbineau, Benjamin Grégoire, Hugo Herbelin, Jorge Luis Sacchini: A New Elimination Rule for the Calculus of Inductive Constructions. TYPES 2008: 32-48

Zena M. Ariola, Hugo Herbelin, Amr Sabry: A proof-theoretic foundation of abortive continuations. Higher-Order and Symbolic Computation 20(4): 403-429 (2007)

Pierre-Louis Curien, Hugo Herbelin: Abstract machines for dialogue games. CoRR abs/0706.2544 (2007)

Hugo Herbelin: On the Degeneracy of Sigma-Types in Presence of Computational Classical Logic. TLCA 2005: 209-220

Zena M. Ariola, Hugo Herbelin, Amr Sabry: A type-theoretic foundation of continuations and prompts. ICFP 2004: 40-53

Zena M. Ariola, Hugo Herbelin: Minimal Classical Logic and Control Operators. ICALP 2003: 871-885

Hugo Herbelin: Explicit Substitutions and Reducibility. J. Log. Comput. 11(3): 431-451 (2001)

Pierre-Louis Curien, Hugo Herbelin: The duality of computation. ICFP 2000: 233-243

Pierre-Louis Curien, Hugo Herbelin: Computing with Abstract Böhm Trees. Fuji International Symposium on Functional and Logic Programming 1998: 20-39

Hugo Herbelin: Games and Weak-Head Reduction for Classical PCF. TLCA 1997: 214-230

Vincent Danos, Hugo Herbelin, Laurent Regnier: Game Semantics & Abstract Machines. LICS 1996: 394-405

Thierry Coquand, Hugo Herbelin: A - Translation and Looping Combinators in Pure Type Systems. J. Funct. Program. 4(1): 77-88 (1994)

Hugo Herbelin: A Lambda-Calculus Structure Isomorphic to Gentzen-Style Sequent Calculus Structure. CSL 1994: 61-75

Michel Cosnard, Afonso Ferreira, Hugo Herbelin: The two list algorithm for the knapsack problem on a FPS T20. Parallel Computing 9(3): 385-388 (1989)