Yong Xiao, Amr Sabry, and Zena M. Ariola. From syntactic theories to interpreters: Automating proofs of unique decomposition. Higher-Order and Symbolic Computation, 14(4):387--409, 2001. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Building Interpreters with Rewriting Strategies - Dolstra, Visser (2002) (2 citations) (Correct)
....semantics, supported by many systems including ASF SDF [4] and ELAN [2] an expression is normalized by successive applications of reduction rules, which define a, generally small, modification of an expression. In the approach of syntactic theories [7] supported for example by the SL language [17,18], a set of reduction rules is extended with evaluation contexts that limit the positions in which reduction rules can be applied. Thus, evaluation contexts overcome a limitation of pure rewriting based semantics. Exhaustive application of reduction rules is usually not an adequate description of ....
Y. Xiao, A. Sabry, and Z. M. Ariola. From syntactic theories to interpreters: Automating the proof of unique decomposition. Higher-Order and Symbolic Computation, 14(4), 2001. 2 20
Building Interpreters with Rewriting Strategies - Dolstra, Visser (2002) (2 citations) (Correct)
....semantics, supported by many systems including ASF SDF [4] and ELAN [2] an expression is normalized by successive applications of reduction rules, which de ne a, generally small, modi cation of an expression. In the approach of syntactic theories [7] supported for example by the SL language [17,18], a set of reduction rules is extended with evaluation contexts that limit the positions in which reduction rules can be applied. Thus, evaluation contexts overcome a limitation of pure rewriting based semantics. Exhaustive application of reduction rules is usually not an adequate description of ....
Y. Xiao, A. Sabry, and Z. M. Ariola. From syntactic theories to interpreters: Automating the proof of unique decomposition. Higher-Order and Symbolic Computation, 14(4), 2001. 2 20
Building Interpreters with Rewriting Strategies - Dolstra, Visser (2002) (2 citations) (Correct)
.... Interpreters with Rewriting Strategies Eelco Dolstra and Eelco Visser Institute of Information and Computing Sciences, Universiteit Utrecht, P.O. Box 80089, 3508 TB Utrecht, The Netherlands. http: www.cs.uu.nl people eelco,visser eelco cs.uu.nl, visser acm.org Abstract Programming language semantics based on pure rewrite rules su#ers from the gap between rewriting strategy implemented in rewriting engines and the intended evaluation ....
....Interpreters with Rewriting Strategies Eelco Dolstra and Eelco Visser Institute of Information and Computing Sciences, Universiteit Utrecht, P.O. Box 80089, 3508 TB Utrecht, The Netherlands. http: www.cs.uu.nl people eelco,visser eelco cs.uu.nl, visser acm.org Abstract Programming language semantics based on pure rewrite rules su#ers from the gap between rewriting strategy implemented in rewriting engines and the intended evaluation strategy. ....
[Article contains additional citation context not shown here]
Y. Xiao, A. Sabry, and Z. M. Ariola. From syntactic theories to interpreters: Automating the proof of unique decomposition. Higher-Order and Symbolic Computation,
From Reduction-Based to Reduction-Free Normalization - Danvy (2004) (Correct)
No context found.
Yong Xiao, Amr Sabry, and Zena M. Ariola. From syntactic theories to interpreters: Automating proofs of unique decomposition. Higher-Order and Symbolic Computation, 14(4):387--409, 2001.
Refocusing in Reduction Semantics - Danvy, Nielsen (2004) (1 citation) (Correct)
No context found.
Yong Xiao, Amr Sabry, and Zena M. Ariola. From syntactic theories to interpreters: Automating proofs of unique decomposition. Higher-Order and Symbolic Computation, 14(4):387--409, 2001.
On Evaluation Contexts, Continuations, and the Rest of Computation - Danvy (Correct)
No context found.
Yong Xiao, Amr Sabry, and Zena M. Ariola. From syntactic theories to interpreters: Automating proofs of unique decomposition. Higher-Order and Symbolic Computation, 14(4):387--409, 2001.
Plan in Maude: Specifying an Active Network Programming Language - Stehr, Talcott (2002) (3 citations) (Correct)
No context found.
Y. Xiao, A. Sabry, and Z. Ariola. From syntactic theories to interpreters: Automating the proof of unique decomposition. Higher-Order and Symbolic Computation, 14(4):387--409, 2001. 21
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