Stéphane Graham-Lengrand
Stéphane Graham-Lengrand
SRI International
No verified email - Homepage
Title
Cited by
Cited by
Year
Intersection types for explicit substitutions
S Lengrand, P Lescanne, D Dougherty, M Dezani-Ciancaglini, ...
Information and Computation 189 (1), 17-42, 2004
672004
Call-by-value, call-by-name, and strong normalization for the classical sequent calculus
S Lengrand
Electronic Notes in Theoretical Computer Science 86 (4), 714-730, 2003
672003
Non-idempotent intersection types and strong normalisation
A Bernadet, SJ Lengrand
arXiv preprint arXiv:1310.1622, 2013
652013
Resource operators for λ-calculus
D Kesner, S Lengrand
Information and Computation 205 (4), 419-473, 2007
652007
The Language χ: Circuits, Computations and Classical Logic
S Van Bakel, S Lengrand, P Lescanne
Italian Conference on Theoretical Computer Science, 81-96, 2005
602005
LJQ: a strongly focused calculus for intuitionistic logic
R Dyckhoff, S Lengrand
Conference on Computability in Europe, 173-185, 2006
472006
Complexity of strongly normalising λ-terms via non-idempotent intersection types
A Bernadet, S Lengrand
International Conference on Foundations of Software Science and …, 2011
442011
Call-by-value λ-calculus and LJQ
R Dyckhoff, S Lengrand
Journal of Logic and Computation 17 (6), 1109-1134, 2007
322007
Extending the explicit substitution paradigm
D Kesner, S Lengrand
International Conference on Rewriting Techniques and Applications, 407-422, 2005
302005
A focused sequent calculus framework for proof search in Pure Type Systems
SJE Lengrand, R Dyckhoff, J McKinna
arXiv preprint arXiv:1012.3372, 2010
242010
Normalisation & Equivalence in Proof Theory & Type Theory
SJE Lengrand
University of St Andrews, 2006
242006
Classical Fω, orthogonality and symmetric candidates
S Lengrand, A Miquel
Annals of pure and applied logic 153 (1-3), 3-20, 2008
222008
Tight typings and split bounds
B Accattoli, S Graham-Lengrand, D Kesner
Proceedings of the ACM on Programming Languages 2 (ICFP), 1-30, 2018
212018
Psyche: a proof-search engine based on sequent calculus with an LCF-style architecture
S Graham-Lengrand
International Conference on Automated Reasoning with Analytic Tableaux and …, 2013
202013
Satisfiability modulo theories and assignments
MP Bonacina, S Graham-Lengrand, N Shankar
International Conference on Automated Deduction, 42-59, 2017
182017
The λ-context calculus
MJ Gabbay, S Lengrand
Electronic Notes in Theoretical Computer Science 196, 19-35, 2008
182008
Induction principles as the foundation of the theory of normalisation: Concepts and techniques
S Lengrand
182005
A bisimulation between DPLL(T) and a proof-search strategy for the focused sequent calculus
M Farooque, S Graham-Lengrand, A Mahboubi
Proceedings of the Eighth ACM SIGPLAN international workshop on Logical …, 2013
132013
On two forms of bureaucracy in derivations
K Brünnler, S Lengrand
Structures and Deduction 2005, 2005
132005
Filter models: non-idempotent intersection types, orthogonality and polymorphism
A Bernadet, S Lengrand
Computer Science Logic (CSL'11)-25th International Workshop/20th Annual …, 2011
122011
The system can't perform the operation now. Try again later.
Articles 1–20