Properties of Infinite Reduction Paths in Untyped λ-Calculus

Properties of Infinite Reduction Paths in Untyped λ-Calculus

Cached

Download Links

[ftp.diku.dk]

by Morten Heine Sørensen

Citations:

1 - 0 self

BibTeX

@MISC{Sørensen_propertiesof,
    author = {Morten Heine Sørensen},
    title = {Properties of Infinite Reduction Paths in Untyped λ-Calculus},
    year = {}
}

Bookmark

OpenURL

Abstract

Citations

431	Associative-commutative rewriting - Dershowitz, Hsiang, et al. - 1983
233	Ordering by divisibility in abstract algebras - Higman - 1952
184	Combinatory Logic - Curry, Feys - 1958
137	The Lambda Calculus: Its Syntax and Semantics. North-Holland, revised edition - Barendregt - 1984
101	the tree theorem, and Vazsonyi’s conjecture - Well-quasi-ordering - 1960
57	On well-quasi-ordering finite trees - Nash-Williams - 1963
39	What’s so special about Kruskal’s theorem and the ordinal Γ0? A survey of some results in proof theory - Gallier - 1991
35	Klop, An analysis of loop checking mechanisms for logic programs, Theoretical Computer Science - Bol, Apt, et al. - 1991
18	The longest perpetual reductions in orthogonal expression reduction systems - Khasidashvili - 1994
17	Degress, reductions and representability in the lambda calculus - Barendregt, Bergstra, et al. - 1976
11	The Undecidability of Self-Embedding for TermRewriting Systems - Plaisted - 1985
10	Lambda-terms as total or partial functions on normal forms - Böhm, Dezani-Ciancaglini - 1975
10	Perpetuality and strong normalization in orthogonal term rewriting systems - Khasidashvili - 1994
7	Nichtbeweisbarkeit von gewissen kombinatorischen eigenschaften endlicher baume. Archiv fur Mathematik., Logik und Grundlagen, 25:45{65 - Simpson - 1985
6	BCK-algebras and lambda calculus - Komori - 1987
5	Infinitary Normalization - Klop, Vrijer - 2005
5	Effective Longest and Infinite Reduction Paths in Untyped - Calculi - Srensen - 1996
4	Semantics of lambda-I and of other substructure calculi - Jacobs
3	A loop-detecting interpreter for lazy programs - Holst, Hughes
3	Lambda-calculus terms that reduce to themselves. Notre Dame - Lercher - 1976
2	Termination tests inside -calculus - Bohm, Coppo, et al. - 1975
2	Naive Set Theory. Springer-Verlag. Undergraduate texts in mathematics - Halmos - 1960
1	BCK-Combinators and Linear -Terms have Types. Theoretical Computer Science 64:97--105 - Hindley - 1989
1	Centre de Recherche en Informatique de Nancy - INRIA-Lorraine - 1995
1	Combinatory Reduction Systems. Doctoral dissertation - Klop - 1980