Reps, T. and B. Alpern. Interactive Proof Checking. In the 11th Ann. ACM Symp. on Principles Of Programming Languages, pages 36-45, 1984. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
AML: Attribute Grammars in ML - Efremidis, Mughal, Reppy, al. (1997) (2 citations) (Correct)
....have implemented a prototype of our system, consisting of a front end, OAG plan generator, and back end for the runtime model described in Section 7. We have tested this prototype on several simple grammars, including a typechecker for a subset of C, and the Hoare logic proof checker described in [36]. We have also experimented with connecting the generated evaluator with an incremental prettyprinter being developed for eXene [12, 13] resulting in a simple structured editor. While the resulting editor is far from being a useful tool, it is a good demonstration of the technology. This ....
REPS, T. AND ALPERN, B. 1984. Interactive Proof Checking. In Conference Record of the 11th Annual ACM Symposium on Principles of Programming Languages, 36--45.
Parallel Attribute Grammar Evaluation - Boehm, Zwaenepoel (1987) (4 citations) (Correct)
....of the phrase language translation to include not only traditional programming language compilation but This research was supported in part by the National Science Foundation under grants DCR 8511436 and DCR 8607200 and by an IBM Faculty Development Award. also text formatting, proof checking [1], assembling, and various other software tools that can be viewed as implementing the translation of a context free language. We are concentrating on the semantic phase of the translation process, rather than on scanning and parsing, since most modern compilers (should) spend relatively little ....
....as part of the Cornell Program Synthesizer to our system. We are particularly interested in grammars in which the evaluation of individual attributes is very expensive relative to the cost of communicating attribute values between machines (such as for instance the proof checker described in [1]) Such grammars should derive most benefit from parallel evaluation. A Appendix The following attribute grammar specifies the value of expressions involving addition and multiplication. An identifier can be introduced and bound to a constant by means of the let construct. The expression let x = ....
B. Alpern and T. Reps, "Interactive Proof Checking", Proceedings of the Eleventh Annual ACM Symposium on Principles of Programming Languages, 1984.
AML: Attribute Grammars in ML - Efremidis, Mughal, Reppy (1993) (2 citations) (Correct)
....have implemented a prototype of our system, consisting of a front end, OAG plan generator, and back end for the runtime model described in Section 7. We have tested this prototype on several simple grammars, including a typechecker for a subset of C, and the Hoare logic proof checker described in [RA84] We have also experimented with connecting the generated evaluator with an incremental pretty printer being developed for eXene [GR91, GR93] resulting in a simple structured editor. While the resulting editor is far from being a useful tool, it is a good demonstration of the technology. The ....
Reps, T. and B. Alpern. Interactive proof checking. In Conference Record of the 11th Annual ACM Symposium on Principles of Programming Languages, January 1984, pp. 36--45.
Transformation System with Attribute Grammars and.. - Vogt, van den Berg.. (1990) (Correct)
No context found.
Reps, T. and B. Alpern. Interactive Proof Checking. In the 11th Ann. ACM Symp. on Principles Of Programming Languages, pages 36-45, 1984.
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