Under the extension of Curry-Howard's correspondence to classical logic, Gentzen's NK and LK systems can be seen as syntaxdirected systems of simple types respectively for Parigot's λμ-calculus and Curien-Herbelin's λ̄μμ̃-calculus. We aim at showing their computational equivalence. We define translations between these calculi. We prove simulation theorems for an undirected evaluation as well as for call-by-name and call-by-value evaluations. © Springer-Verlag Berlin Heidelberg 2005.
CITATION STYLE
Rocheteau, J. (2005). λμ-calculus and duality: Call-by-name and call-by-value. In Lecture Notes in Computer Science (Vol. 3467, pp. 204–218). Springer Verlag. https://doi.org/10.1007/978-3-540-32033-3_16
Mendeley helps you to discover research relevant for your work.