J.R. Kennaway  Home/Search
Context
Related
| sys.uea.ac.uk/pub/kennaway/p...tr.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: sys.uea.ac.uk/pub/kennaway/pub... (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: . We survey the basic concepts and properties of transfinite rewriting for orthogonal term rewrite systems, lambda calculus, higher-order rewrite systems, and abstract rewrite systems. 1 Introduction Transfinite rewriting is the rewriting of terms which may be finite or infinite, by reduction sequences which may have any finite or infinite ordinal length. There are several reasons for studying transfinite rewriting, beyond its interest as a piece of pure mathematics. Lazy functional... (Update)
Active bibliography (related documents): More All
0.3: Infinitary Lambda Calculus - Kennaway, Klop, Sleep, de Vries (1995) (Correct)
0.3: Meaningless Terms in Rewriting - Kennaway, van Oostrom, de Vries (1996) (Correct)
0.3: Generalizing Finiteness Conditions of Labelled Transition Systems - van Breugel (1993) (Correct)
Similar documents based on text: More All
0.8: On the Adequacy of Graph Rewriting for Simulating Term.. - Kennaway, Klop, Sleep.. (1994) (Correct)
0.3: Transfinite Rewriting Semantics for Term Rewriting Systems - Lucas (2001) (Correct)
0.3: Continuity, Proof Systems and the theory of transfinite.. - Normann (1996) (Correct)
BibTeX entry: (Update)
@misc{ kennaway-transfinite,
author = "J.R. Kennaway",
title = "Transfinite Rewriting",
url = "citeseer.ist.psu.edu/330671.html" }
Citations (may not include all citations):210 its Syntax and Semantics (context) - Barendregt, Calculus - 1984
174 Combinatory Reduction Systems (context) - Klop - 1980
130 Full abstraction in the lazy lambda calculus (context) - Abramsky, Ong - 1993 ACM DBLP
126 Higher-order critical pairs (context) - Nipkow - 1991 DBLP
71 Transfinite reductions in orthogonal term rewriting systems - Kennaway, Klop et al. - 1995 ACM DBLP
57 Confluence for abstract and higher-order rewriting (context) - van Oostrom - 1994
51 Handbook of Mathematical Logic (context) - Barwise - 1977
31 Confluence and normalisation for higher-order rewriting (context) - van Raamsdonk - 1996
21 Redex capturing in term graph rewriting (context) - Farmer, Watro - 1991 DBLP
20 Expression reduction systems - Khasidashvili - 1990
14 Infinitary lambda calculus - Kennaway, Klop et al.
8 Discrete normalization and standardization in deterministic .. - Khasidashvili, Glauert - 1996 ACM DBLP
6 Transfinite abstract reduction systems (context) - Kennaway
6 On transfinite abstract reduction systems (context) - Kennaway - 1992 ACM
4 calculus and non-sensible models (context) - Berarducci - 1994
1 Transfinite orthogonal expression reduction systems (context) - Glauert, Kennaway et al.
Documents on the same site (ftp://ftp.sys.uea.ac.uk/pub/kennaway/publications/): More
Event Structures and Non-orthogonal term graph rewriting - Dav Clark And (1996) (Correct)
A Conflict Between Call-by-Need Computation and Parallelism - Kennaway (1994) (Correct)
Infinitary Lambda Calculus - Kennaway, Klop, Sleep, de Vries (1996) (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