2008 |
14 | EE | Kentaro Kikuchi,
Stéphane Lengrand:
Strong Normalisation of Cut-Elimination That Simulates beta-Reduction.
FoSSaCS 2008: 380-394 |
13 | EE | Stéphane Lengrand,
Alexandre Miquel:
Classical Fomega, orthogonality and symmetric candidates.
Ann. Pure Appl. Logic 153(1-3): 3-20 (2008) |
12 | EE | Stéphane Lengrand:
Termination of lambda-calculus with the extra Call-By-Value rule known as assoc
CoRR abs/0806.4859: (2008) |
11 | EE | Murdoch Gabbay,
Stéphane Lengrand:
The lambda-context Calculus.
Electr. Notes Theor. Comput. Sci. 196: 19-35 (2008) |
2007 |
10 | EE | Delia Kesner,
Stéphane Lengrand:
Resource operators for lambda-calculus.
Inf. Comput. 205(4): 419-473 (2007) |
9 | EE | Roy Dyckhoff,
Stéphane Lengrand:
Call-by-Value lambda-calculus and LJQ.
J. Log. Comput. 17(6): 1109-1134 (2007) |
2006 |
8 | EE | Stéphane Lengrand,
Roy Dyckhoff,
James McKinna:
A Sequent Calculus for Type Theory.
CSL 2006: 441-455 |
7 | EE | Roy Dyckhoff,
Stéphane Lengrand:
LJQ: A Strongly Focused Calculus for Intuitionistic Logic.
CiE 2006: 173-185 |
6 | EE | Roy Dyckhoff,
Delia Kesner,
Stéphane 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,
Stéphane Lengrand,
Pierre Lescanne:
The Language chi: Circuits, Computations and Classical Logic.
ICTCS 2005: 81-96 |
4 | EE | Delia Kesner,
Stéphane Lengrand:
Extending the Explicit Substitution Paradigm.
RTA 2005: 407-422 |
2004 |
3 | EE | Stéphane 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 | Stéphane 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,
Stéphane Lengrand,
Pierre Lescanne:
An Improved System of Intersection Types for Explicit Substitutions.
IFIP TCS 2002: 511-523 |