A syntactic correspondence between context-sensitive calculi and abstract machines-Reference-Cited by-同舟云学术

A syntactic correspondence between context-sensitive calculi and abstract machines

Published:2007-05 Issue:1-3 Volume:375 Page:76-108
ISSN:0304-3975
Container-title:Theoretical Computer Science
language:en
Short-container-title:Theoretical Computer Science

Author:

Biernacka Małgorzata,Danvy Olivier

Publisher

Elsevier BV

Subject

General Computer Science,Theoretical Computer Science

Reference103 articles.

1. Explicit substitutions;Abadi;Journal of Functional Programming,1991

2. M.S. Ager, Partial evaluation of string matchers and constructions of abstract machines, Ph.D. Thesis, BRICS Ph.D. School, University of Aarhus, Aarhus, Denmark, January 2006

3. A functional correspondence between evaluators and abstract machines;Ager,2003

4. A functional correspondence between call-by-need evaluators and lazy abstract machines;Ager;Information Processing Letters,2004

5. A functional correspondence between monadic evaluators and abstract machines for languages with computational effects;Ager;Theoretical Computer Science,2005

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

1. A simple and efficient implementation of strong call by need by an abstract machine;Proceedings of the ACM on Programming Languages;2022-08-29

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

3. A verified abstract machine for functional coroutines;Electronic Proceedings in Theoretical Computer Science;2016-06-19

4. Implementing a secure abstract machine;Proceedings of the 31st Annual ACM Symposium on Applied Computing;2016-04-04

5. A Dynamic Continuation-Passing Style for Dynamic Delimited Continuations;ACM Transactions on Programming Languages and Systems;2015-10-16