Paul-Andre Mellies  Home/Search
Context Related
| pps.jussieu.fr/~me...actorisation.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: pps.jussieu.fr/~mellies/papers (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Some computations on a symbolic term M are more judicious than others, for instance the leftmost outermost derivations in the -calculus. In order to characterise generically that kind of judicious computations, [M] introduces the notion of external derivations in its axiomatic description of Rewriting Systems: a derivation e : M \Gamma! P is said to be external when the derivation e; f : M \Gamma! Q is standard whenever the derivation f : P \Gamma! Q is standard. (Update)
Similar documents based on text: More All
0.7: Axiomatic Rewriting Theory III - A factorisation theorem in.. - Melliès (1997) (Correct)
0.5: Axiomatic Rewriting Theory IV - A stability theorem in Rewriting.. - Melliès (1998) (Correct)
0.3: Axiomatic Rewriting Theory I - A Diagrammatic Standardization.. - Mellies (2001) (Correct)
BibTeX entry: (Update)
Paul-Andr'e Melli`es. Axiomatic rewriting theory III: A factorisation theorem in rewriting theory. In Proceedings of the 7th Conference on Category Theory and Computer Science, CTCS'97, volume 1290 of Lecture Notes in Computer Science, pages 46--68, Santa Margherita Ligure, 1997. Springer Verlag. http://citeseer.ist.psu.edu/mellies97axiomatic.html More
@misc{ mellies97axiomatic,
author = "P. Mellies",
title = "Axiomatic rewriting theory III: A factorisation theorem in rewriting theory",
text = "Paul-Andr'e Melli`es. Axiomatic rewriting theory III: A factorisation theorem
in rewriting theory. In Proceedings of the 7th Conference on Category Theory
and Computer Science, CTCS'97, volume 1290 of Lecture Notes in Computer
Science, pages 46--68, Santa Margherita Ligure, 1997. Springer Verlag.",
year = "1997",
url = "citeseer.ist.psu.edu/mellies97axiomatic.html" }
Citations (may not include all citations):729 The Lambda Calculus: Its Syntax and Semantics (context) - Barendregt - 1985
562 Categories for the working mathematician (context) - Lane - 1971
174 Combinatory Reduction Systems (context) - Klop - 1980
67 Computational semantics of term rewriting systems (context) - Boudol - 1985
50 Concurrent Transition Systems - Stark - 1989
47 Abstract and Concrete Categories (context) - Adamek, Herrlich et al. - 1990
36 Call by Need Computations in Non-Ambiguous Linear Term Rewri.. (context) - Huet, L'evy - 1991
35 An abstract standardisation theorem - Gonthier, L'evy et al. - 1992
31 Categories of continuous functors (context) - Freyd, Kelly - 1972
12 Church-Rosser property and homology of monoids (context) - Lafont, Prout'e - 1991
11 Event structures and non-orthogonal term graph rewriting - Clark, Kennaway - 1996
7 A new finiteness condition for monoids presented by complete.. - Lafont - 1995
5 R'eductions correctes et optimales dans le -calcul (context) - L'evy - 1978
5 Description abstraite des syst`emes de r'e'ecriture (context) - Mellies - 1996
3 Categorical Structure of Closure Operators. With Application.. (context) - Dikranjan, Tholen - 1995
[Article contains additional citations not shown here]
Documents on the same site (http://www.pps.jussieu.fr/~mellies/papers.html): More
Semantic Types: A Fresh Look at the Ideal Model for Types - Vouillon, Mellies, Diderot (2004) (Correct)
Double Categories: a modular model of multiplicative linear logic - Mellies (Correct)
Asynchronous Games 2 - The true concurrency of innocence - Mellies (2004) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC