Stéphane Lengrand

Available identifiers

Publication	Date of Publication	Type
The \(\lambda\)-context calculus	2014-01-10	Paper
Non-idempotent intersection types and strong normalisation	2013-10-16	Paper
Call-by-value, call-by-name, and strong normalization for the classical sequent calculus	2013-08-27	Paper
Filter models: non-idempotent intersection types, orthogonality and polymorphism	2012-09-18	Paper
A Focused Sequent Calculus Framework for Proof Search in Pure Type Systems	2011-05-26	Paper
Complexity of Strongly Normalising λ-Terms via Non-idempotent Intersection Types	2011-05-19	Paper
The lambda-context calculus (extended version)	2009-12-11	Paper
A Sequent Calculus for Type Theory	2009-03-12	Paper
Strong Cut-Elimination Systems for Hudelmaier’s Depth-Bounded Sequent Calculus for Implicational Logic	2009-03-12	Paper
Classical \(F_{\omega}\), orthogonality and symmetric candidates	2008-04-24	Paper
Strong Normalisation of Cut-Elimination That Simulates β-Reduction	2008-04-11	Paper
Call-by-Value -calculus and LJQ	2008-02-07	Paper
Logical Approaches to Computational Barriers	2007-04-30	Paper
Resource operators for \(\lambda\)-calculus	2007-04-16	Paper
Theoretical Computer Science	2006-11-01	Paper
Term Rewriting and Applications	2005-11-11	Paper
Intersection types for explicit substitutions	2004-11-23	Paper

This page was built for person: Stéphane Lengrand