|
1
|
Strong Normalisation of Cut-Elimination that Simulates β-Reduction
– Kentaro Kikuchi, Stéphane Lengrand
|
|
52
|
Constructive Logics. Part I: A Tutorial on Proof Systems and Typed λ-Calculi
– Jean Gallier
- 1992
|
|
1
|
Proving Properties of Typed Lambda Terms Using Realizability, Covers, and Sheaves
– Jean Gallier, Jean Gallier
- 1995
|
|
14
|
Modified Realizability Toposes and Strong Normalization Proofs (Extended Abstract)
– J.M.E. Hyland, C. -h. L. Ong
- 1993
|
|
|
Proving Properties of Typed λ-Terms Using Realizability, Covers, and Sheaves
– Jean Gallier
- 1995
|
|
2
|
Resource operators for λ-calculus
– Delia Kesner, Stéphane Lengrand
- 2007
|
|
6
|
Completing Herbelin’s programme
– José Espírito Santo
|
|
3
|
The safe lambda calculus
– William Blum, C. -h, Luke Ong
- 2007
|
|
1
|
On Zucker's isomorphism for LJ and its extension to Pure Type Systems
– Felix Joachimski
- 2003
|
|
29
|
Strong Normalisation of Cut-Elimination in Classical Logic
– C. Urban, G. M. Bierman
- 2000
|
|
|
Discrete Mathematics Some Notes
– Jean Gallier, C Jean Gallier, Jean Gallier
|
|
2
|
Characterising Strong Normalisation for Explicit Substitutions
– Steffen Van Bakel, Mariangiola Dezani-ciancaglini
- 2002
|
|
2
|
On the Correspondence between Proofs and λ-Terms
– Jean Gallier
- 1997
|
|
1
|
Strong Normalization for Non-structural Subtyping via Saturated Sets
– Jakob Rehof
- 1996
|
|
3
|
Reducibility: a ubiquitous method in lambda calculus with intersection types
– Silvia Ghilezan, École Normale, Supérieure Lyon, Silvia Likavec
- 2002
|
|
|
Strong Normalization of Call-By-Push-Value
– Christian Doczkal
- 2007
|
|
6
|
A Lambda Model Characterizing Computational Behaviours of Terms
– Mariangiola Dezani-Ciancaglini, Silvia Ghilezan
- 2001
|
|
|
Behavioural Inverse Limit λ-Models
– Mariangiola Dezani-Ciancaglini, Silvia Ghilezan, Silvia Likavec
- 2003
|
|
3
|
Typing Untyped Lambda-Terms, or Reducibility Strikes Again!
– Jean Gallier, Jean Gallier
- 1995
|
