Stéphane Lengrand

Publication Activity (10 Years)

Years Active: 2002-2013
Publications (10 Years): 0

Top Topics

Sequent Calculus

Simulation Environment

Top Venues

Log. Methods Comput. Sci.

Publications

Alexis Bernadet, Stéphane Lengrand
Non-idempotent intersection types and strong normalisation. Log. Methods Comput. Sci. 9 (4) (2013)
Mahfuza Farooque, Stéphane Lengrand
A sequent calculus with procedure calls CoRR (2012)
Mahfuza Farooque, Stéphane Lengrand, Assia Mahboubi
Two simulations about DPLL(T) CoRR (2012)
Stéphane Lengrand, Roy Dyckhoff, James McKinna
A Focused Sequent Calculus Framework for Proof Search in Pure Type Systems Log. Methods Comput. Sci. 7 (1) (2011)
Alexis Bernadet, Stéphane Lengrand
-Terms via Non-idempotent Intersection Types. FoSSaCS (2011)
Alexis Bernadet, Stéphane Lengrand
Filter Models: Non-idempotent Intersection Types, Orthogonality and Polymorphism. CSL (2011)
Murdoch James Gabbay, Stéphane Lengrand
The lambda-context calculus (extended version). Inf. Comput. 207 (12) (2009)
Stéphane Lengrand, Alexandre Miquel
, orthogonality and symmetric candidates. Ann. Pure Appl. Log. 153 (1-3) (2008)
Kentaro Kikuchi, Stéphane Lengrand
Strong Normalisation of Cut-Elimination That Simulates beta-Reduction. FoSSaCS (2008)
Stéphane Lengrand
Termination of lambda-calculus with the extra Call-By-Value rule known as assoc CoRR (2008)
Murdoch Gabbay, Stéphane Lengrand
The lambda-context Calculus. Electron. Notes Theor. Comput. Sci. 196 (2008)
Delia Kesner, Stéphane Lengrand
Resource operators for lambda-calculus. Inf. Comput. 205 (4) (2007)
Roy Dyckhoff, Stéphane Lengrand
Call-by-Value lambda-calculus and LJQ. J. Log. Comput. 17 (6) (2007)
Stéphane Lengrand, Roy Dyckhoff, James McKinna
A Sequent Calculus for Type Theory. CSL (2006)
Roy Dyckhoff, Delia Kesner, Stéphane Lengrand
Strong Cut-Elimination Systems for Hudelmaier's Depth-Bounded Sequent Calculus for Implicational Logic. IJCAR (2006)
Roy Dyckhoff, Stéphane Lengrand
LJQ: A Strongly Focused Calculus for Intuitionistic Logic. CiE (2006)
Delia Kesner, Stéphane Lengrand
Extending the Explicit Substitution Paradigm. RTA (2005)
Steffen van Bakel, Stéphane Lengrand, Pierre Lescanne
The Language chi: Circuits, Computations and Classical Logic. ICTCS (2005)
Stéphane Lengrand, Pierre Lescanne, Daniel J. Dougherty, Mariangiola Dezani-Ciancaglini, Steffen van Bakel
Intersection types for explicit substitutions. Inf. Comput. 189 (1) (2004)
Stéphane Lengrand
Call-by-value, call-by-name, and strong normalization for the classical sequent calculus. Electron. Notes Theor. Comput. Sci. 86 (4) (2003)
Daniel J. Dougherty, Stéphane Lengrand, Pierre Lescanne
An Improved System of Intersection Types for Explicit Substitutions. IFIP TCS (2002)