References

1. John Clements, Matthew Flatt & Matthias Felleisen (2001): Modeling an algebraic stepper. In: European symposium on programming. Springer, pp. 320–334, doi:10.1007/3-540-45309-1_21.
2. Olivier Danvy & Andrzej Filinski (1990): Abstracting Control. In: Proceedings of the 1990 ACM Conference on Lisp and Functional Programming, LFP '90, pp. 151–160, doi:10.1145/91556.91622.
3. Matthias Felleisen, Robert Bruce Findler & Matthew Flatt (2009): Semantics engineering with PLT Redex. MIT Press.
4. Matthias Felleisen & Daniel P. Friedman (1986): Control operators, the SECD-machine, and the λ-calculus. In: M. Wirsing: Formal Description of Programming Concepts III. Elsevier, pp. 193–219. Available at https://cs.indiana.edu/ftp/techreports/TR197.pdf.
5. Casey Klein, John Clements, Christos Dimoulas, Carl Eastlund, Matthias Felleisen, Matthew Flatt, Jay A. McCarthy, Jon Rafkind, Sam Tobin-Hochstadt & Robert Bruce Findler (2012): Run Your Research: On the Effectiveness of Lightweight Mechanization. In: Proceedings of the 39th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL '12. ACM, New York, NY, USA, pp. 285–296, doi:10.1145/2103656.2103691.
6. Preston Tunnell Wilson, Kathi Fisler & Shriram Krishnamurthi (2018): Evaluating the Tracing of Recursion in the Substitution Notional Machine. In: Proceedings of the 49th ACM Technical Symposium on Computer Science Education, SIGCSE '18. ACM, pp. 1023–1028, doi:10.1145/3159450.3159479.

Comments and questions to: eptcs@eptcs.org

For website issues: webmaster@eptcs.org