| 2008 |
|---|
| 12 | EE | Kentaro Kikuchi,
Stephane Lengrand:
Strong Normalisation of Cut-Elimination That Simulates beta-Reduction.
FoSSaCS 2008: 380-394 |
| 11 | EE | Murdoch Gabbay,
Stephane Lengrand:
The lambda-context Calculus.
Electr. Notes Theor. Comput. Sci. 196: 19-35 (2008) |
| 2007 |
|---|
| 10 | EE | Delia Kesner,
Stephane Lengrand:
Resource operators for lambda-calculus.
Inf. Comput. 205(4): 419-473 (2007) |
| 9 | EE | Roy Dyckhoff,
Stephane Lengrand:
Call-by-Value lambda-calculus and LJQ.
J. Log. Comput. 17(6): 1109-1134 (2007) |
| 2006 |
|---|
| 8 | EE | Stephane Lengrand,
Roy Dyckhoff,
James McKinna:
A Sequent Calculus for Type Theory.
CSL 2006: 441-455 |
| 7 | EE | Roy Dyckhoff,
Stephane Lengrand:
LJQ: A Strongly Focused Calculus for Intuitionistic Logic.
CiE 2006: 173-185 |
| 6 | EE | Roy Dyckhoff,
Delia Kesner,
Stephane Lengrand:
Strong Cut-Elimination Systems for Hudelmaier's Depth-Bounded Sequent Calculus for Implicational Logic.
IJCAR 2006: 347-361 |
| 2005 |
|---|
| 5 | EE | Steffen van Bakel,
Stephane Lengrand,
Pierre Lescanne:
The Language chi: Circuits, Computations and Classical Logic.
ICTCS 2005: 81-96 |
| 4 | EE | Delia Kesner,
Stephane Lengrand:
Extending the Explicit Substitution Paradigm.
RTA 2005: 407-422 |
| 2004 |
|---|
| 3 | EE | Stephane Lengrand,
Pierre Lescanne,
Daniel J. Dougherty,
Mariangiola Dezani-Ciancaglini,
Steffen van Bakel:
Intersection types for explicit substitutions.
Inf. Comput. 189(1): 17-42 (2004) |
| 2003 |
|---|
| 2 | EE | Stephane Lengrand:
Call-by-value, call-by-name, and strong normalization for the classical sequent calculus.
Electr. Notes Theor. Comput. Sci. 86(4): (2003) |
| 2002 |
|---|
| 1 | | Daniel J. Dougherty,
Stephane Lengrand,
Pierre Lescanne:
An Improved System of Intersection Types for Explicit Substitutions.
IFIP TCS 2002: 511-523 |
