The SCEAS System
| |||||||

## Search the dblp DataBase
Hugo Herbelin:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Hugo Herbelin
**A Lambda-Calculus Structure Isomorphic to Gentzen-Style Sequent Calculus Structure.**[Citation Graph (0, 0)][DBLP] CSL, 1994, pp:61-75 [Conf] - Pierre-Louis Curien, Hugo Herbelin
**Computing with Abstract Böhm Trees.**[Citation Graph (0, 0)][DBLP] Fuji International Symposium on Functional and Logic Programming, 1998, pp:20-39 [Conf] - Zena M. Ariola, Hugo Herbelin
**Minimal Classical Logic and Control Operators.**[Citation Graph (0, 0)][DBLP] ICALP, 2003, pp:871-885 [Conf] - Zena M. Ariola, Hugo Herbelin, Amr Sabry
**A type-theoretic foundation of continuations and prompts.**[Citation Graph (0, 0)][DBLP] ICFP, 2004, pp:40-53 [Conf] - Pierre-Louis Curien, Hugo Herbelin
**The duality of computation.**[Citation Graph (0, 0)][DBLP] ICFP, 2000, pp:233-243 [Conf] - Vincent Danos, Hugo Herbelin, Laurent Regnier
**Game Semantics & Abstract Machines.**[Citation Graph (0, 0)][DBLP] LICS, 1996, pp:394-405 [Conf] - Hugo Herbelin
**On the Degeneracy of Sigma-Types in Presence of Computational Classical Logic.**[Citation Graph (0, 0)][DBLP] TLCA, 2005, pp:209-220 [Conf] - Hugo Herbelin
**Games and Weak-Head Reduction for Classical PCF.**[Citation Graph (0, 0)][DBLP] TLCA, 1997, pp:214-230 [Conf] - Thierry Coquand, Hugo Herbelin
**A - Translation and Looping Combinators in Pure Type Systems.**[Citation Graph (0, 0)][DBLP] J. Funct. Program., 1994, v:4, n:1, pp:77-88 [Journal] - Hugo Herbelin
**Explicit Substitutions and Reducibility.**[Citation Graph (0, 0)][DBLP] J. Log. Comput., 2001, v:11, n:3, pp:431-451 [Journal] - Michel Cosnard, Afonso Ferreira, Hugo Herbelin
**The two list algorithm for the knapsack problem on a FPS T20.**[Citation Graph (0, 0)][DBLP] Parallel Computing, 1989, v:9, n:3, pp:385-388 [Journal] - Pierre-Louis Curien, Hugo Herbelin
**Abstract machines for dialogue games**[Citation Graph (0, 0)][DBLP] CoRR, 2007, v:0, n:, pp:- [Journal] **Equality Is Typable in Semi-full Pure Type Systems.**[Citation Graph (, )][DBLP]**An Intuitionistic Logic that Proves Markov's Principle.**[Citation Graph (, )][DBLP]**An approach to call-by-name delimited continuations.**[Citation Graph (, )][DBLP]**An Operational Account of Call-by-Value Minimal and Classical lambda-Calculus in "Natural Deduction" Form.**[Citation Graph (, )][DBLP]**A New Elimination Rule for the Calculus of Inductive Constructions.**[Citation Graph (, )][DBLP]**Forcing-Based Cut-Elimination for Gentzen-Style Intuitionistic Sequent Calculus.**[Citation Graph (, )][DBLP]**Kripke Models for Classical Logic**[Citation Graph (, )][DBLP]
Search in 0.012secs, Finished in 0.013secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |