Stéphane Lengrand

21 papers A 1B 4C 1Journal 10Unranked 5
YearRankTypeTitle / Venue / Authors
2013 J jnl
Non-idempotent intersection types and strong normalisation.
Log. Methods Comput. Sci.
Alexis Bernadet, Stéphane Lengrand
2012 J jnl
A sequent calculus with procedure calls
CoRR
Mahfuza Farooque, Stéphane Lengrand
2012 J jnl
Two simulations about DPLL(T)
CoRR
Mahfuza Farooque, Stéphane Lengrand, Assia Mahboubi
2011 J jnl
A Focused Sequent Calculus Framework for Proof Search in Pure Type Systems
Log. Methods Comput. Sci.
Stéphane Lengrand, Roy Dyckhoff, James McKinna
2011 B conf
Complexity of Strongly Normalising
FoSSaCS
Alexis Bernadet, Stéphane Lengrand
2011 B conf
Filter Models: Non-idempotent Intersection Types, Orthogonality and Polymorphism.
CSL
Alexis Bernadet, Stéphane Lengrand
2009 J jnl
The lambda-context calculus (extended version).
Inf. Comput.
Murdoch James Gabbay, Stéphane Lengrand
2008 J jnl
Classical F
Ann. Pure Appl. Log.
Stéphane Lengrand, Alexandre Miquel
2008 B conf
Strong Normalisation of Cut-Elimination That Simulates beta-Reduction.
FoSSaCS
Kentaro Kikuchi, Stéphane Lengrand
2008 J jnl
Termination of lambda-calculus with the extra Call-By-Value rule known as assoc
CoRR
Stéphane Lengrand
2007 J jnl
Call-by-Value lambda-calculus and LJQ.
J. Log. Comput.
Roy Dyckhoff, Stéphane Lengrand
2007 J jnl
Resource operators for lambda-calculus.
Inf. Comput.
Delia Kesner, Stéphane Lengrand
2007 — conf
The lambda-context Calculus.
LFMTP@CADE
Murdoch Gabbay, Stéphane Lengrand
2006 B conf
A Sequent Calculus for Type Theory.
CSL
Stéphane Lengrand, Roy Dyckhoff, James McKinna
2006 C conf
LJQ: A Strongly Focused Calculus for Intuitionistic Logic.
CiE
Roy Dyckhoff, Stéphane Lengrand
2006 A conf
Strong Cut-Elimination Systems for Hudelmaier's Depth-Bounded Sequent Calculus for Implicational Logic.
IJCAR
Roy Dyckhoff, Delia Kesner, Stéphane Lengrand
2005 — conf
Extending the Explicit Substitution Paradigm.
RTA
Delia Kesner, Stéphane Lengrand
2005 — conf
The Language chi: Circuits, Computations and Classical Logic.
ICTCS
Steffen van Bakel, Stéphane Lengrand, Pierre Lescanne
2004 J jnl
Intersection types for explicit substitutions.
Inf. Comput.
Stéphane Lengrand, Pierre Lescanne, Daniel J. Dougherty, Mariangiola Dezani-Ciancaglini, Steffen van Bakel
2003 — conf
Call-by-value, call-by-name, and strong normalization for the classical sequent calculus.
WRS
Stéphane Lengrand
2002 — conf
An Improved System of Intersection Types for Explicit Substitutions.
IFIP TCS
Daniel J. Dougherty, Stéphane Lengrand, Pierre Lescanne