Constructive Logics. Part I: A Tutorial on Proof Systems and Typed λ-Calculi (1992)

by Jean Gallier
Citations:61 - 3 self

Active Bibliography

2 On the Correspondence between Proofs and λ-Terms – Jean Gallier - 1997
6 On the Correspondence Between Proofs and λ-Terms – Jean Gallier - 1995
8 Constructive Logics. Part I: A Tutorial on Proof Systems and Typed-Calculi – Jean Gallier
Some Notes – Jean H. Gallier, Jean Gallier, C Jean Gallier, Jean Gallier
Discrete Mathematics for Computer Science Some Notes – Jean Gallier, C Jean Gallier, Jean Gallier
19 On an Intuitionistic Modal Logic – G M Bierman, V C V de Paiva - 2001
15 Cut Rules and Explicit Substitutions – René Vestergaard, Joe Wells - 2000
3 Strong Normalization in a Non-Deterministic Typed Lambda-Calculus – Philippe de Groote - 1994
8 A Classical Linear λ-calculus – G.M. Bierman - 1997
4 On the form of witness terms – Stefan Hetzl - 2010
35 Strong Normalisation of Cut-Elimination in Classical Logic – C. Urban, G. M. Bierman - 2000
Strong Normalization of Call-By-Push-Value – Christian Doczkal - 2007
1 Conservation and Uniform Normalization in Lambda Calculi With Erasing Reductions – Peter Møller Neergaard, Morten Heine Sørensen - 2002
A Semantic Normalization Proof for Inductive Types – Lisa Allali, Paul Brauner - 2008
40 Cut-Elimination and a Permutation-Free Sequent Calculus for Intuitionistic Logic – Roy Dyckhoff , Luis Pinto - 1998
1 Proving Properties of Typed Lambda Terms Using Realizability, Covers, and Sheaves – Jean Gallier, Jean Gallier - 1995
3 Typing Untyped Lambda-Terms, or Reducibility Strikes Again! – Jean Gallier, Jean Gallier - 1995
Proving Properties of Typed λ-Terms Using Realizability, Covers, and Sheaves – Jean Gallier - 1995
8 Typing untyped λ-terms, or Reducibility strikes again! – Jean Gallier - 1995