Automating Derivations of Abstract Machines from Reduction Semantics:-Reference-Cited by-同舟云学术

Automating Derivations of Abstract Machines from Reduction Semantics:

Published:2011 Issue: Volume: Page:72-88
ISSN:0302-9743
Container-title:Implementation and Application of Functional Languages
language:
Short-container-title:

Author:

Sieczkowski Filip,Biernacka Małgorzata,Biernacki Dariusz

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-24276-2_5

Reference17 articles.

1. Biernacka, M., Biernacki, D.: Formalizing constructions of abstract machines for functional languages in Coq. In: Giesl, J. (ed.) Preliminary proceedings of the Seventh International Workshop on Reduction Strategies in Rewriting and Programming (WRS 2007), Paris, France (June 2007)

2. Biernacka, M., Danvy, O.: A concrete framework for environment machines. ACM Transactions on Computational Logic 9(1), 1–30 (2007)

3. Biernacka, M., Danvy, O.: A syntactic correspondence between context-sensitive calculi and abstract machines. Theoretical Computer Science 375(1-3), 76–108 (2007)

4. Lecture Notes in Computer Science;M. Biernacka,2009

5. Lecture Notes in Computer Science;J. Chrząszcz,2003

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Automating the Functional Correspondence Between Higher-Order Evaluators and Abstract Machines;Logic-Based Program Synthesis and Transformation;2022

2. From Push/Enter to Eval/Apply by Program Transformation;Electronic Proceedings in Theoretical Computer Science;2016-06-19

3. Deriving Pretty-Big-Step Semantics from Small-Step Semantics;Programming Languages and Systems;2014

4. A Semantics for Context-Sensitive Reduction Semantics;Programming Languages and Systems;2011