当前位置: X-MOL 学术J. Funct. Program. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
A correct-by-construction conversion from lambda calculus to combinatory logic
Journal of Functional Programming ( IF 1.1 ) Pub Date : 2023-11-22 , DOI: 10.1017/s0956796823000084
WOUTER SWIERSTRA

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.

中文翻译:

从 lambda 演算到组合逻辑的构造修正转换,从 lambda 演算到组合逻辑的构造修正转换

这颗珍珠定义了从类型良好的 lambda 术语到组合逻辑的转换,其中类型的保存和转换的正确性都是静态强制执行的。,这颗珍珠定义了从类型良好的 lambda 术语到组合逻辑的转换,其中类型的保存和转换的正确性都是静态强制执行的。
更新日期:2023-11-22
down
wechat
bug