A One-Pass CPS Transform with Simulation on the Nose
Paper in proceeding, 2026

Danvy & Nielsen’s one-pass CPS transform has a straightforward definition, but clashes between the names of variables it introduces make it difficult to mechanically prove correct. Existing mechanical proofs either side-step the issue by using nameless representations, or rely on tedious α-equivalence relations between target terms. This paper presents a new formulation of the transform using evaluation contexts that allows deterministic introduction of fresh names, eliminating the need to work up to α-equivalence. We use our formulation to present a new and straightforward simulation proof of the correctness of the one-pass CPS transform, which we have mechanised in the HOL4 theorem prover.

Author

Pascal Y. Lasnier

University of Cambridge

Jeremy Yallop

University of Cambridge

Magnus Myreen

University of Gothenburg

Chalmers, Computer Science and Engineering (Chalmers), Formal methods

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

03029743 (ISSN) 16113349 (eISSN)

Vol. 16401 LNCS 21-38
9783032159809 (ISBN)

28th International Symposium on Practical Aspects of Declarative Languages, PADL 2026
Rennes, France,

Subject Categories (SSIF 2025)

Computer Sciences

DOI

10.1007/978-3-032-15981-6_2

More information

Latest update

2/2/2026 1