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

JOURNAL OF FUNCTIONAL PROGRAMMING（2023）

引用 0|浏览0

暂无评分

摘要

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.

查看译文

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要