Home
About
Advanced Search
Browse by Discipline
Scientific Societies
E-print Alerts
Add E-prints
FAQ
•
HELP
•
SITE MAP
•
CONTACT US
Search
Advanced Search
Lengrand, Stéphane - CNRS & Laboratoire d’Informatique, École Polytechnique
Extending the explicit substitution paradigm Delia Kesner 1 and Stephane Lengrand 1,2
Strong Normalisation of LJQ Stphane Lengrand1,2
Normalisation & Equivalence in Proof Theory & Type Theory
ARTICLE IN PRESS Annals of Pure and Applied Logic ( )
Strong cut-elimination systems for Hudelmaier's depth-bounded sequent calculus for implicational logic
Non-idempotent intersection types, orthogonality and filter models
Deriving Strong Normalisation Stphane Lengrand
Electronic Notes in Theoretical Computer Science 86 No. 4 (2003) URL: http://www.elsevier.nl/locate/entcs/volume86.html 16 pages
Strong Normalisation of Cut-Elimination that Simulates -Reduction
A Sequent Calculus for Type Theory Stphane Lengrand1,2
Complexity of strongly normalising -terms via non-idempotent intersection types
A Strongly Focused Calculus for Intuitionistic Logic
Universit Paris VII --Denis Diderot University of St Andrews
Callbyvalue, callbyname, and strong normalization for the classical sequent calculus
A Focused Sequent Calculus Framework for Proof Search in Pure Type Systems
Call-by-Value -calculus and LJQ Roy Dyckhoff and Stphane Lengrand
Resource operators for -calculus Delia Kesner1
Intersection types for explicit substitutions Stephane Lengrand a
Filter models: non-idempotent intersection types, orthogonality and polymorphism
Strong Normalisation of Cut-Elimination that Simulates -Reduction
The -context Calculus Murdoch J. Gabbay
AN IMPROVED SYSTEM OF INTERSECTION TYPES
