Preservation of Termination for Explicit Substitution

Preservation of Termination for Explicit Substitution (1997)

Cached

Download Links

[www.win.tue.nl]

by Carolus Johannes Bloo

Citations:

38 - 1 self

BibTeX

@MISC{Bloo97preservationof,
    author = {Carolus Johannes Bloo},
    title = {Preservation of Termination for Explicit Substitution},
    year = {1997}
}

Bookmark

OpenURL

Abstract

Citations

339	Con uent reductions: Abstract properties and applications to term rewriting systems - Huet - 1980
253	Interpretation fonctionelle et elimination des coupures de l’arithmetique d’ordre superieur. These d’Etat - Girard - 1972
237	Combinatory Reduction Systems - Klop - 1980
170	Introduction to Combinators and #-calculus - Hindley, Seldin - 1986
119	Higher-order critical pairs - Nipkow - 1991
105	Semantics and Pragmatics of the Lambda Calculus - Wadsworth - 1971
82	Termination of term rewriting by semantic labelling - Zantema - 1995
75	Confluence for Abstract and Higher-Order Rewriting - Oostrom - 1994
73	Logics and Type Systems - Geuvers - 1993
72	A λ-calculus à la de bruijn with explicit substitutions - Kamareddine, Ríos - 1995
57	On well-quasi-ordering finite trees - Nash-Williams - 1963
45	Typed -calculi with explicit substitutions may not terminate - Melli`es - 1995
39	On stepwise explicit substitution - Kamareddine, Nederpelt - 1993
33	Confluence Results for the Pure Strong Categorical Combinatory Logic - Hardin - 1988
33	A λ-calculus structure isomorphic to sequent calculus structure,Computer science logic - Herbelin - 1997
33	Confluence and Normalisation for Higher-Order Rewriting - Raamsdonk - 1996
30	Explicit substitutions with de Bruijn levels - Lescanne, Rouyer-Degli - 1995
24	Operational Reduction Models for Functional Programming Languages - Rose - 1996
23	Weak orthogonality implies confluence: the higher-order case - Oostrom, Raamsdonk - 1994
22	Confluence properties of extensional and non-extensional λ-calculi with explicit substitutions (extended abstract - Kesner - 1996
22	Explicit cyclic substitutions - Rose - 1992
20	Confluence and preservation of strong normalisation in an explicit substitution calculus, Rapport de Recherche No 2762 - Muñoz
18	Comparing combinatory reduction systems and higher-order rewrite systems. volume 816 - Oostrom, Raamsdonk - 1993
18	de Pol. Termination of Higher-order Rewrite Systems - van - 1996
16	Combinatory reduction systems with explicit substitution - Rose - 1995
11	The λs-calculus: Its typed and its extended versions - Kamareddine, Ríos - 1995
8	A recursive path ordering for higher-order terms in j-long fi-normal form - Jouannaud, Rubio - 1996
7	Dependent Types with Explicit Substitutions: A Metatheoretical development - Muñoz
7	Normalization for typed lambda calculi with explicit substitution - Ritter - 1993
6	The confluence of the se-calculus via a generalized interpretation method - Kamareddine, R'ios - 1996
6	Term rewriting systems. In Abramsky et al - Klop - 1993
5	The Lambda Delta Calculus - Rehof, Sorensen - 1996
4	Meta-theoretical properties of OE : A left-linear variant of oe - Munoz - 1997
4	Type systems --- basic ideas and applications - Nederpelt - 1990
3	A confluent calculus of substitutions. Rapport de Recherche 90-11 - Hardin, L'evy - 1990
3	The fine-structure of lambda calculus - Nederpelt - 1992
3	de Pol. Termination proofs for higher-order rewrite systems - van
2	Explicit cyclic substitutions. Semantics Note D-166 - Rose - 1993
1	A comparison of length of reductions for explicit substitution calculi. Private Communication - Kamareddine, R'ios - 1996
1	From oe to AE--a journey through calculi of explicit substitutions - Lescanne - 1994
1	A useful lambda notation - Nederpelt, Kamareddine - 1992
1	Contributions `a l''etude des *-calculs avec des substitutions explicites - R'ios - 1993
1	On proving Higman's theorem and its extension by Kruskal intuitionistically - Veldman - 1997
1	The oe-oe-rule terminates. Private communication - Zantema - 1996