Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Stéphane Lengrand
Stéphane Graham-Lengrand
2010 – today
- 2013
[i4]Mahfuza Farooque, Stéphane Graham-Lengrand: Sequent Calculi with procedure calls. CoRR abs/1304.6279 (2013)- 2012
- [i3]Mahfuza Farooque, Stéphane Lengrand: A sequent calculus with procedure calls. CoRR abs/1204.5156 (2012)
- [i2]Mahfuza Farooque, Stéphane Lengrand, Assia Mahboubi: Two simulations about DPLL(T). CoRR abs/1204.5159 (2012)
- 2011
- [j8]Stéphane Lengrand, Roy Dyckhoff, James McKinna: A Focused Sequent Calculus Framework for Proof Search in Pure Type Systems. Logical Methods in Computer Science 7(1) (2011)
- [c9]Alexis Bernadet, Stéphane Lengrand: Filter Models: Non-idempotent Intersection Types, Orthogonality and Polymorphism. CSL 2011: 51-66
- [c8]Alexis Bernadet, Stéphane Lengrand: Complexity of Strongly Normalising λ-Terms via Non-idempotent Intersection Types. FOSSACS 2011: 88-107
2000 – 2009
- 2009
- [j7]Murdoch James Gabbay, Stéphane Lengrand: The lambda-context calculus (extended version). Inf. Comput. 207(12): 1369-1400 (2009)
- 2008
- [j6]Stéphane Lengrand, Alexandre Miquel: Classical Fomega, orthogonality and symmetric candidates. Ann. Pure Appl. Logic 153(1-3): 3-20 (2008)
- [j5]Murdoch Gabbay, Stéphane Lengrand: The lambda-context Calculus. Electr. Notes Theor. Comput. Sci. 196: 19-35 (2008)
- [c7]Kentaro Kikuchi, Stéphane Lengrand: Strong Normalisation of Cut-Elimination That Simulates beta-Reduction. FoSSaCS 2008: 380-394
- [i1]Stéphane Lengrand: Termination of lambda-calculus with the extra Call-By-Value rule known as assoc. CoRR abs/0806.4859 (2008)
- 2007
- [j4]Delia Kesner, Stéphane Lengrand: Resource operators for lambda-calculus. Inf. Comput. 205(4): 419-473 (2007)
- [j3]Roy Dyckhoff, Stéphane Lengrand: Call-by-Value lambda-calculus and LJQ. J. Log. Comput. 17(6): 1109-1134 (2007)
- 2006
- [c6]Roy Dyckhoff, Delia Kesner, Stéphane Lengrand: Strong Cut-Elimination Systems for Hudelmaier's Depth-Bounded Sequent Calculus for Implicational Logic. IJCAR 2006: 347-361
- [c5]Roy Dyckhoff, Stéphane Lengrand: LJQ: A Strongly Focused Calculus for Intuitionistic Logic. CiE 2006: 173-185
- [c4]Stéphane Lengrand, Roy Dyckhoff, James McKinna: A Sequent Calculus for Type Theory. CSL 2006: 441-455
- 2005
- [c3]Steffen van Bakel, Stéphane Lengrand, Pierre Lescanne: The Language chi: Circuits, Computations and Classical Logic. ICTCS 2005: 81-96
- [c2]
- 2004
- [j2]Stéphane Lengrand, Pierre Lescanne, Daniel J. Dougherty, Mariangiola Dezani-Ciancaglini, Steffen van Bakel: Intersection types for explicit substitutions. Inf. Comput. 189(1): 17-42 (2004)
- 2003
- [j1]Stéphane Lengrand: Call-by-value, call-by-name, and strong normalization for the classical sequent calculus. Electr. Notes Theor. Comput. Sci. 86(4): 714-730 (2003)
- 2002
- [c1]Daniel J. Dougherty, Stéphane Lengrand, Pierre Lescanne: An Improved System of Intersection Types for Explicit Substitutions. IFIP TCS 2002: 511-523
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-05-03 21:44 CEST by the dblp team