A correct-by-construction conversion from lambda calculus to combinatory logic

DSpace/Manakin Repository

A correct-by-construction conversion from lambda calculus to combinatory logic
 
Swierstra, Wouter
(2023) Journal of Functional Programming, volume 33, issue 1, pp. 1 - 9
(Article)
Abstract
This pearl defines a translation from well-typed lambda terms to combinatory logic, where both the preservation of types and the correctness of the translation are enforced statically.
Download/Full Text
Open Access version via Utrecht University Repository Publisher version
 
Keywords: Software
DOI: https://doi.org/10.1017/S0956796823000084
ISSN: 0956-7968
Publisher: Cambridge University Press [etc.]
Note: Publisher Copyright: © 2023 Cambridge University Press. All rights reserved.
(Peer reviewed)
 
 
See more statistics about this item