Formalizing Implementation Strategies for First-Class Continuations
ESOP '00 Proceedings of the 9th European Symposium on Programming Languages and Systems
Proving Syntactic Properties of Exceptions in an Ordered Logical Framework
FLOPS '01 Proceedings of the 5th International Symposium on Functional and Logic Programming
A First-Order One-Pass CPS Transformation
FoSSaCS '02 Proceedings of the 5th International Conference on Foundations of Software Science and Computation Structures
Natural Deduction for Intuitionistic Non-communicative Linear Logic
TLCA '99 Proceedings of the 4th International Conference on Typed Lambda Calculi and Applications
Proceedings of the 3rd ACM SIGPLAN international conference on Principles and practice of declarative programming
A first-order one-pass CPS transformation
Theoretical Computer Science
A formalization of an Ordered Logical Framework in Hybrid with applications to continuation machines
MERLIN '03 Proceedings of the 2003 ACM SIGPLAN workshop on Mechanized reasoning about languages with variable binding
Game semantics and linear CPS interpretation
Theoretical Computer Science - Foundations of software science and computation structures
| Hi-index | 0.00 |
We prove an occurrence property about formal parameters of continuations in Continuation-Passing Style (CPS) terms that have been automatically produced by CPS transformation of pure, call-by-value lambda-terms. Essentially, parameters of continuations obey a stack-like discipline. This property was introduced, but not formally proven, in an earlier work on the Direct-Style transformation (the inverse of the CPS transformation). The proof has been implemented in Elf, a constraint logic programming language based on the logical framework LF. In fact, it was the implementation that inspired the proof. Thus this note also presents a case study of machine-assisted proof discovery.