Completeness of algebraic CPS simulations

Abstract : The algebraic lambda calculus and the linear algebraic lambda calculus are two extensions of the classical lambda calculus with linear combinations of terms. They arise independently in distinct contexts: the former is a fragment of the differential lambda calculus, the latter is a candidate lambda calculus for quantum computation. They differ in the handling of application arguments and algebraic rules. The two languages can simulate each other using an algebraic extension of the well-known call-by-value and call-by-name CPS translations. These simulations are sound, in that they preserve reductions. In this paper, we prove that the simulations are actually complete, strengthening the connection between the two languages.
Complete list of metadatas
Contributor : Nicolas Peltier <>
Submitted on : Friday, January 17, 2014 - 4:10:13 PM
Last modification on : Friday, October 25, 2019 - 2:00:41 AM

Links full text




Ali Assaf, Simon Perdrix. Completeness of algebraic CPS simulations. DCM 2011 - International Workshop on Developments of Computational Methods (satellite event of ICALP 2011), Jul 2011, Zurich, Switzerland. pp.16-27, ⟨10.4204/EPTCS.88.2⟩. ⟨hal-00932770⟩



Record views