2009 |
16 | EE | Danko Ilik,
Gyesik Lee,
Hugo Herbelin:
Kripke Models for Classical Logic
CoRR abs/0904.0071: (2009) |
2008 |
15 | EE | Hugo Herbelin,
Silvia Ghilezan:
An approach to call-by-name delimited continuations.
POPL 2008: 383-394 |
14 | EE | Zena M. Ariola,
Hugo Herbelin:
Control reduction theories: the benefit of structural substitution.
J. Funct. Program. 18(3): 373-419 (2008) |
2007 |
13 | EE | Pierre-Louis Curien,
Hugo Herbelin:
Abstract machines for dialogue games
CoRR abs/0706.2544: (2007) |
12 | EE | Zena M. Ariola,
Hugo Herbelin,
Amr Sabry:
A proof-theoretic foundation of abortive continuations.
Higher-Order and Symbolic Computation 20(4): 403-429 (2007) |
2005 |
11 | EE | Hugo Herbelin:
On the Degeneracy of Sigma-Types in Presence of Computational Classical Logic.
TLCA 2005: 209-220 |
2004 |
10 | EE | Zena M. Ariola,
Hugo Herbelin,
Amr Sabry:
A type-theoretic foundation of continuations and prompts.
ICFP 2004: 40-53 |
2003 |
9 | EE | Zena M. Ariola,
Hugo Herbelin:
Minimal Classical Logic and Control Operators.
ICALP 2003: 871-885 |
2001 |
8 | EE | Hugo Herbelin:
Explicit Substitutions and Reducibility.
J. Log. Comput. 11(3): 431-451 (2001) |
2000 |
7 | EE | Pierre-Louis Curien,
Hugo Herbelin:
The duality of computation.
ICFP 2000: 233-243 |
1998 |
6 | | Pierre-Louis Curien,
Hugo Herbelin:
Computing with Abstract Böhm Trees.
Fuji International Symposium on Functional and Logic Programming 1998: 20-39 |
1997 |
5 | | Hugo Herbelin:
Games and Weak-Head Reduction for Classical PCF.
TLCA 1997: 214-230 |
1996 |
4 | | Vincent Danos,
Hugo Herbelin,
Laurent Regnier:
Game Semantics & Abstract Machines.
LICS 1996: 394-405 |
1994 |
3 | | Hugo Herbelin:
A Lambda-Calculus Structure Isomorphic to Gentzen-Style Sequent Calculus Structure.
CSL 1994: 61-75 |
2 | | Thierry Coquand,
Hugo Herbelin:
A - Translation and Looping Combinators in Pure Type Systems.
J. Funct. Program. 4(1): 77-88 (1994) |
1989 |
1 | | 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) |