Axiomatic Rewriting Theory I - A Diagrammatic Standardization Theorem

Axiomatic Rewriting Theory I - A Diagrammatic Standardization Theorem (2001)

Cached

Download Links

by Paul-Andre Mellies , Equipe Preuves

Citations:

BibTeX

@MISC{Mellies01axiomaticrewriting,
    author = {Paul-Andre Mellies and Equipe Preuves},
    title = {Axiomatic Rewriting Theory I - A Diagrammatic Standardization Theorem},
    year = {2001}
}

Bookmark

OpenURL

Abstract

Machine translation ## -calculus interpretation ## -calculus Formally, the -calculus contains two classes of objects: terms and substitutions. Terms are written in the de Bruijn notation.

Citations

997	The Lambda Calculus, its Syntax and Semantics - Barendregt - 1984
822	Term rewriting and All That - Baader, Nipkow - 1998
816	S.: Categories for the working mathematician - Lane - 1998
550	Term rewriting systems - Klop - 1992
359	Explicit Substitutions - Abadi, Cardelli, et al. - 1992
339	Con uent reductions: Abstract properties and applications to term rewriting systems - Huet - 1980
242	Models for concurrency - Winskel, Nielsen - 1995
237	The revised report on the syntactic theories of sequential control and state - Felleisen, Hieb - 1992
104	On theories with a combinatorial definition of “equivalence - Newman - 1942
75	Confluence for Abstract and Higher-Order Rewriting - Oostrom - 1994
63	Some properties of conversion - Church, Rosser
51	Higher operads, higher categories - Leinster - 2004
42	Concurrent machines - Shields - 1985
38	Modèles complètement adéquats et stables des lambda-calculs typés. Thèse de Doctorat d’État, Université Paris VII - Berry - 1979
35	Call by need computations in non-ambiguous linear term rewriting systems - Huet, Levy - 1979
33	Confluence Results for the Pure Strong Categorical Combinatory Logic - Hardin - 1988
28	Description Abstraite des Systèmes de Réécriture. Thèse de doctorat - Melliès - 1996
20	Functional back-ends within the lambdasigma calculus - Hardin, Maranget, et al. - 1996
17	R'eductions correctes et optimales dans le -calcul. Th`ese de doctorat d'etat, Universit'e Paris VII - L'evy - 1978
13	Typed lambda-calculi with explicit substitutions may not terminate - Mellies - 1995
13	Termination of term rewriting by interpretation - ZANTEMA - 1993
11	Rewrite Proofs and Computations - Jouannaud - 1995
10	Computational semantics of term rewriting systems. In: Algebraic methods in semantics - Boudol - 1985
10	Towards a proof theory of rewriting: the simply typed 2λ-calculus - Hilken - 1996
10	Stability and sequentiality in dataflow networks - Panangaden, Shanbhogue, et al. - 1990
8	Strong normalization of substitutions - Curien, Hardin, et al. - 1992
7	Confluence and Normalization for higher-order rewriting - Raamsdonk - 1996
6	Axiomatic rewriting theory VI: Residual theory revisited - Melliès
4	Event structures and non-orthogonal term graph rewriting - Clark, Kennaway - 1996
4	Axiomatic Rewriting Theory IV: A stability theorem in Rewriting Theory - Melliès - 1998
3	P.A.Mellies, \An Abstract Standardization Theorem - Gonthier - 1992
2	Rewrite systems. Chap - Dershowitz, Jouannaud - 1990
2	Axiomatic Rewriting Theory II: The lambda-sigma-calculus enjoys finite normalisation cones - Melliès - 2000
2	Axiomatic Rewriting Theory III: A factorisation theorem in Rewriting Theory - Melliès - 1997
1	Categories of asynchronous systems - Bednarczyck - 1988
1	Combinatory Reduction Systems. Thèse de l’Université d’Utrecht, Pays-Bas - Klop - 1980
1	Chapter 4 in the book Term Rewriting System, edited by TeReSe, Cambridge Tracts - Orthogonality - 2003
1	de Vrijer. Equivalence of reductions. Chapter 8 in the book Term Rewriting System, edited by TeReSe, Cambridge Tracts - Oostrom, R - 2003
1	Call-by-name, call-by-value, and the�-calculus - Plotkin - 1975
1	Rewrite systems. Chap. 6 of Handbook of Theoretical Computer Science B: Formal Methods and Semantics - Dershowitz, Jouannaud - 1990
1	the Association for Computing Machinery vol. 27, No 4 - Huet, Lévy - 1980