Yong Xiao, Amr Sabry, Zena M. Ariola  Home/Search
Context Related
| indiana.edu/~sabry/p...uniquedecomp.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: indiana.edu/~sabry/papers...index (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Developing syntactic theories for reasoning about programming languages usually involves proving a unique-decomposition lemma. The proof of such a lemma is tedious, error-prone, and is usually attempted many times during the design of a theory. We therefore investigate the automation of such proofs. (Update)
Context of citations to this paper: More
...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,...
Cited by: More
From Reduction-Based to Reduction-Free Normalization - Danvy (2004) (Correct)
Refocusing in Reduction Semantics - Danvy, Nielsen (2004) (Correct)
On Evaluation Contexts, Continuations, and the Rest of Computation - Danvy (Correct)
Similar documents (at the sentence level):
40.0%: From Syntactic Theories to Interpreters: Automating the.. - Xiao, Sabry, Ariola (Correct)
Similar documents based on text: More All
1.0: Computational Content of Unique Decomposition Proofs - Amr Sabry (Correct)
0.9: From Syntactic Theories to Interpreters: A Specification.. - Xiao, Ariola, Mauny (2000) (Correct)
0.7: Correctness of Monadic State: An Imperative Call-by-Need Calculus - Ariola, Sabry (1998) (Correct)
Related documents from co-citation: More All
3: Technical Report (context) - Borra, Clement et al. - 1987
3: Natural Semantics (context) - Kahn - 1987
3: Composing programming languages by combining action-semantics modules (context) - Doh, Mosses - 2001
BibTeX entry: (Update)
Y. Xiao, A. Sabry, and Z. M. Ariola. From syntactic theories to interpreters: Automating the proof of unique decomposition. Higher-Order and Symbolic Computation, http://citeseer.ist.psu.edu/xiao01from.html More
@misc{ xiao-from,
author = "Y. Xiao and A. Sabry and Z. Ariola",
title = "From syntactic theories to interpreters: Automating the proof of unique
decomposition",
text = "Y. Xiao, A. Sabry, and Z. M. Ariola. From syntactic theories to interpreters:
Automating the proof of unique decomposition. Higher-Order and Symbolic
Computation,",
url = "citeseer.ist.psu.edu/xiao01from.html" }
Citations not processed or no citations identified.
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.indiana.edu/~sabry/papers/index.html): More
Monadic State: Axiomatization and Type Safety - John Launchbury (1997) (Correct)
Macros as Multi-Stage Computations: Type-Safe, Generative.. - Ganz, Sabry, Taha (Correct)
Reasoning about Programs in Continuation-Passing Style - Amr Sabry (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