Syntactic theories in practice

Electronic Notes in Theoretical Computer Science

Volumn 59, Issue 4, 2001, Pages 358-374

  Danvy, Olivier ^a   Nielsen, Lasse R ^a  

^a AARHUS UNIVERSITY   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING; COMPUTER PROGRAMMING LANGUAGES; CONTEXT FREE GRAMMARS; LINEAR PROGRAMMING; PROGRAM INTERPRETERS; QUADRATIC PROGRAMMING; SEMANTICS; SET THEORY;

CONTINUATION-PASSING STYLE (CPS); PLUGGING; QUADRIATIC TIME PROGRAM TRANSFORMATIONS; SYNTACTIC THEORY;

SYNTACTICS;

EID: 0142159450     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1571-0661(04)00297-X     Document Type: Article

References (14)

1. Danvy Olivier, Filinski Andrzej. Representing control, a study of the CPS transformation. Mathematical Structures in Computer Science. 2:(4):1992;361-391
2. Olivier Danvy and Lasse R. Nielsen. CPS transformation of beta-redexes. In Amr Sabry, editor, Proceedings of the Third ACM SIGPLAN Workshop on Continuations, Technical report 545, Computer Science Department, Indiana University, pages 35-39, London, England, January 2001.
3. Also available as the technical report BRICS RS-00-35.
4. Olivier Danvy and Lasse R. Nielsen. Defunctionalization at work. In Harald Søndergaard, editor, Proceedings of the Third International Conference on Principles and Practice of Declarative Programming, pages 162-174, Firenze, Italy, September 2001. ACM Press.
5. Extended version available as the technical report BRICS RS-01-23.
6. Olivier Danvy and Lasse R. Nielsen. Syntactic theories in practice. Technical Report BRICS RS-01-31, DAIMI, Department of Computer Science, University of Aarhus, Aarhus, Denmark, July 2001.
7. Extended version of an article to appear in the informal proceedings of the Second International Workshop on Rule-Based Programming (RULE 2001), Firenze, Italy, September 4, 2001.
8. Matthias Felleisen. The Calculi of λ-v-CS Conversion: A Syntactic Theory of Control and State in Imperative Higher-Order Programming Languages. PhD thesis, Department of Computer Science, Indiana University, Bloomington, Indiana, August 1987.
9. John Hopcroft E., Jeffrey Ullman D. Introduction to Automata Theory, Languages, and Computation. 1979;Addison-Wesley
10. Gordon Plotkin D. Call-by-name, call-by-value and the λ-calculus. Theoretical Computer Science. 1:1975;125-159
11. Sabry Amr, Felleisen Matthias. Reasoning about programs in continuation-passing style. Lisp and Symbolic Computation. 6:(3/4):1993;289-360
12. Mitchell Wand. Correctness of procedure representations in higher-order assembly language. In Stephen Brookes, Michael Main, Austin Melton, Michael Mislove, and David Schmidt, editors, Proceedings of the 7th International Conference on Mathematical Foundations of Programming Semantics, number 598 in Lecture Notes in Computer Science, pages 294-311, Pittsburgh, Pennsylvania, March 1991. Springer-Verlag.
13. Yong Xiao, Zena M. Ariola, and Michel Mauny. From syntactic theories to interpreters: A specification language and its compilation. In Nachum Dershowitz and Claude Kirchner, editors, Informal proceedings of the First International Workshop on Rule-Based Programming (RULE 2000), Montréal, Canada, September 2000. Available online at http://www.loria.fr/~ckirchne/=rule2000/ proceedings/.
14. Xiao Yong, Sabry Amr, Zena Ariola M. From syntactic theories to interpreters: Automating proofs of decomposition lemma. Higher-Order and Symbolic Computation. 14:(4):2001;. To appear