J.B. Wells, Robert Muller  Home/Search
Context Related
| bc.edu/~muller/postscript/WMhosc.ps 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: bc.edu/~muller/papers (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: A rewrite system has standardization i for any rewrite sequence there is an equivalent one which contracts the redexes in a standard order. Standardization is extremely useful for finding normalizing strategies and proving that a rewrite system for a programming language is sound with respect to the language's operational semantics. Although for some rewrite systems the standard-order can be simple, e.g., left-to-right or outermost-first, many systems need a more delicate order. There are... (Update)
Context of citations to this paper: More
...two worked examples of a general framework that supports rigorous proofs of standardization theorems. The framework, developed in [WM00], is abstract enough to handle a large class of languages, yet it is nevertheless concrete enough that the programming language theorist...
...part of the theorem is as for TRSs. For a proof of the rst part for left linear fully extended (orthogonal) CRSs see [18, Sect. 7.7. 3] [26]) By the correspondence between CRSs and P 2 RSs this suces for our purposes. STD even holds for PRSs [22, Cor. 1.5] ut Proof. of...
Cited by: More
A Computationally Sound Call-by-Value Module Calculus - Machkasova, Turbak (2001) (Correct)
Uniform Normalisation beyond Orthogonality - Khasidashvili, Ogawa, van Oostrom (2001) (Correct)
Two Applications of Standardization and Evaluation in.. - Muller, Wells (2000) (Correct)
Similar documents (at the sentence level):
62.6%: Standard Reduction in CRS's and Applications in Programming.. - Muller, Wells (1999) (Correct)
Active bibliography (related documents): More All
0.8: The complete list of RTA open problems - Date April Summary (Correct)
0.4: Generational Parallel Varying Mutation GAs and their Applications - Duran (2003) (Correct)
0.3: Confluence by Developments and Development Closed Critical Pairs - van Oostrom (Correct)
System load high. Please wait...
Timeout. Please try your query later.
Similar documents based on text: More All
0.6: Compilation of Combinatory Reduction Systems - Kahrs (1993) (Correct)
0.3: On the Standardization Theorem for ...-Calculus - Kashima (2001) (Correct)
0.2: An Standardisation Theorem - Georges Gonthier Jean-Jacques (Correct)
Related documents from co-citation: More All
3: Computations in orthogonal rewriting systems (context) - Huet, L'evy - 1991
3: A call-by-need lambda calculus - Ariola, Felleisen et al. - 1995
3: An abstract standardisation theorem - Gonthier, L'evy et al. - 1992
BibTeX entry: (Update)
J. B. Wells and Robert Muller. Standardization and evaluation in combinatory reduction systems. Unpublished draft to be submitted, 2000. http://citeseer.ist.psu.edu/wells00standardization.html More
@misc{ wells00standardization,
author = "J. Wells and R. Muller",
title = "Standardization and evaluation in combinatory reduction systems",
note = "Unpublished draft to be submitted.",
year = "2000",
url = "citeseer.ist.psu.edu/wells00standardization.html" }
Citations (may not include all citations):353 Term Rewriting and All That (context) - Baader, Nipkow - 1998
169 The call-by-need lambda calculus - Ariola, Felleisen - 1997
151 Proving termination with multiset orderings (context) - Dershowitz, Manna - 1979
138 The revised report on the syntactic theories of sequential c.. - Felleisen, Hieb - 1992
126 Higher-order critical pairs (context) - Nipkow - 1991
102 Computations in orthogonal rewriting systems (context) - erard, Jean-Jacques et al.
102 Computations in orthogonal rewriting systems (context) - erard, Jean-Jacques et al.
87 call-by-value and the lambda calculus (context) - Plotkin - 1975
45 Call by need computations to root-stable form - Middeldorp - 1997
44 Programming in equational logic: Beyond strong sequentiality - Sekar, Ramakrishnan - 1993
35 An abstract standardisation theorem - Gonthier, evy et al. - 1992
30 A syntactic theory of sequential state (context) - Felleisen, Friedman - 1989
30 Combinatory Reduction Systems (context) - Klop - 1980
28 Studies in Logic and the Foundations of Mathematics (context) - Curry, Feys - 1958
28 Needed reduction and spine strategies for the lambda calculu.. (context) - Barendregt, Kennaway et al. - 1987
26 The Lambda Calculus: Its Syntax and Semantics (context) - Barendregt - 1984
24 A sequential reduction strategy - Antoy, Middeldorp - 1996
22 Sequential evaluation strategies for parallel-or and related.. (context) - Kennaway - 1989
22 Higher-order families - van Oostrom - 1996
20 Expression reduction systems - Khasidashvili - 1990
20 Full abstraction and the context lemma - Jim, Meyer - 1996
19 LISP: A representation-independent dialect of LISP with redu.. (context) - Muller - 1992
19 calculi with conditional rules (context) - Takahashi - 1993
18 Sequentiality in orthogonal term rewriting systems (context) - Klop, Middeldorp - 1991
15 Context-sensitive conditional expression reduction systems - Khasidashvili, van Oostrom - 1995
14 Higher-order narrowing with denitional trees (context) - Hanus, Prehofer - 1999
14 Combinatory Reduction Systems: Introduction and survey - Klop, van Oostrom et al. - 1993
13 Practical Foundations of Mathematics (context) - Taylor - 1999
9 Con uence and Normalisation for Higher-Order Rewriting (context) - van Raamsdonk - 1996
8 Discrete normalization and standardization in deterministic .. - Khasidashvili, Glauert
8 Standardization theorem revisited - Suzuki
7 Axiomatic Rewriting Theory IV: A stability theorem in Rewrit.. (context) - Melli - 1998
6 Con uence for Abstract and Higher-Order Rewriting (context) - van Oostrom - 1994
5 Computational Logic: Essays in Honor of Alan Robinson (context) - Lassez, Plotkin - 1991
4 Minimal and optimal relative normalization in orthogonal exp.. - Glauert, Kenneway et al. - 2000
4 Compilation of Combinatory Reduction Systems - Kahrs - 1994
4 Description Abstraite des Systemes de Reecriture (context) - Melli - 1996
4 Minimal and optimal relative normalization in orthogonal exp.. - Glauert, Khasidashvili - 1996
2 Ecient Functional Programming: Compilation and Programming T.. (context) - ocker - 1994
2 volume 21 of Cambridge Tracts in Theoretical Comp (context) - Wolfram, Theory - 1993
2 Finite family developments - van Oostrom - 1997
1 Two applications of standardization and evaluation in Combin.. - Muller, Wells - 2000
Documents on the same site (http://oak.bc.edu/~muller/papers.html): More
Compiling with Polymorphic and Polyvariant Flow Types - Turbak, Dimock, Muller, Wells (1997) (Correct)
Domain Theory for Nonmonotonic Functions - Zhou, Muller (1990) (Correct)
Strongly Typed Flow-Directed Representation.. - Dimock, Muller.. (1997) (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