: Notation classique ↦ → Notation de de Bruijn

: Notation classique ↦ → Notation de de Bruijn

Cached

Download Links

[www.cedar-forest.org]

by Willem Klop , La Substitution

BibTeX

@MISC{Klop_:notation,
    author = {Willem Klop and La Substitution},
    title = {: Notation classique ↦ → Notation de de Bruijn},
    year = {}
}

Bookmark

OpenURL

Abstract

• I first met Thérèse in 1992 in the Netherlands at a meeting organised by Jan

Citations

997	The Lambda Calculus, its Syntax and Semantics - Barendregt - 1984
728	A formulation of the simple theory of types - Church - 1940
634	A framework for defining logics - Harper, Honsell, et al. - 1999
253	Interpretation fonctionelle et elimination des coupures de l’arithmetique d’ordre superieur. These d’Etat - Girard - 1972
166	A call-by-need lambda calculus - Ariola, Felleisen, et al. - 1995
114	Confluence properties of weak and strong calculi of explicit substitutions - Hardin - 1996
90	λυ, a calculus of explicit substitutions which preserves strong normalisation - Benaissa, Briaud, et al. - 1996
70	A direct algorithm for type inference in the rank-2 fragment of the second-order λ-calculus - Kfoury, Wells - 1994
69	The mathematical language AUTOMATH, its usage and some of its extensions - Bruijn - 1968
53	Theorem proving modulo - Dowek, Hardin, et al.
44	Lambda-calcul et réseaux - Regnier - 1992
41	Strong Normalization in a Typed Lambda Calculus with Lambda Structured Types - Nederpelt - 1973
39	On stepwise explicit substitution - Kamareddine, Nederpelt - 1993
29	The Barendregt cube with definitions and generalised reduction - Bloo, Kamareddine, et al. - 1996
26	The conservation theorem revisited - Groote - 1993
25	Une équivalence sur les lambda termes - Regnier - 1994
14	Constructive natural deduction and its modest interpretation - Longo, Moggi - 1988
13	Extending a λ-calculus with explicit substitution which preserves strong normalisation into a confluent calculus on open terms - Kamareddine, Ríos - 1997
9	Strictness analysis via abstract interpretation for recursively defined types - Lavalette - 1991
7	Higher order unification via explicit substitutions - Dowek, Hardin, et al. - 2000
7	Calculi of generalised β-reduction and explicit substitutions: The type free and simply typed versions - Kamareddine, Ríos, et al. - 1998
5	De Bruijn’s syntax and reductional behaviour of lambda terms - Kamareddine, Bloo
5	Types in logic and mathematics before 1940 - Kamareddine, Laan, et al. - 2002
4	Jerzy Tiuryn, and Pawel Urzyczyn. An analysis of ML typability - Kfoury - 1994
2	Revisiting the λ-calculus notion of function - Kamareddine, Laan, et al. - 2003
2	De Bruijn’s syntax and reductional equivalence of lambda terms - Kamareddine, Bloo, et al.
1	Ayala-Rincón and Fairouz Kamareddine. Unification via the lambda se-style of explicit substitutions - Mauricio
1	le 7 Juillet 2010 140 Coquand and - Thérèse, Paris - 1988
1	le 7 Juillet 2010 141 Hindley and J.P. Seldin. Introduction to Combinators and λ-calculus - Thérèse, Paris - 1986
1	Refining the Barendregt cube using parameters - Kamareddine, Laan, et al.
1	le 7 Juillet 2010 142 Kamareddine and Rob Nederpelt. Refining reduction in the λ-calculus - Thérèse, Paris - 1995
1	le 7 Juillet 2010 - Thérèse, Paris - 1995
1	le 7 Juillet 2010 144 Reynolds. Towards a theory of type structure - Thérèse, Paris - 1974