J. B. Wells and R. Muller. Standardization and evaluation in Combinatory Reduction Systems. Unpublished draft to be submitted, 2000. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Uniform Normalisation beyond Orthogonality - Khasidashvili, Ogawa, van Oostrom (2001) (1 citation) (Correct)
....7 (STD) Any rewrite sequence in a P 2 RS can be transformed into a standard one. The transformation preserves in niteness. Proof. The proof of the second 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 Theorem 6) Replace in the proof of Theorem 2 everywhere k by . That the (context) case eventually applies follows by an appeal to FD. ut The proofs of the ....
J.B. Wells and Robert Muller. Standardization and evaluation in combinatory reduction systems, 2000. Working paper.
Two Applications of Standardization and Evaluation in.. - Muller, Wells (2000) Self-citation (Wells Muller) (Correct)
....that their system satis es the various axioms. In practice, this is very dicult problem in its own right. 1.1 Contributions of this Paper In this paper we present 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 can embed their language in it without too much diculty. The framework uses higher order rewriting systems (HORS s) speci cally, combinatory reduction systems ....
....to normalization [SR93] 1.3 Overview Section 2 summarizes mathematical nomenclature and de nes combinatory reduction systems (CRSs) Section 3 presents the two calculi, de nes their corresponding CRSs and proves con uence results. Section 4 summarizes the de nitions and salient theorems from [WM00]. Subsection 4.2 summarizes the details of obtaining good redex ordering functions via a subterm ordering function generator which is parameterized over the CRS. Subsection 4.3 summarizes the details of deriving a notion of evaluation for certain constructor CRSs. Section 5 applies the results of ....
[Article contains additional citation context not shown here]
J. B. Wells and Robert Muller. Standardization and evaluation in combinatory reduction systems. Unpublished draft to be submitted, 2000.
A Computationally Sound Call-by-Value Module Calculus - Machkasova, Turbak (2001) (Correct)
No context found.
J. B. Wells and R. Muller. Standardization and evaluation in Combinatory Reduction Systems. Unpublished draft to be submitted, 2000.
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