从λ演算到组合逻辑的按结构正确的转换

IF 1.1 3区计算机科学 Q4 COMPUTER SCIENCE, SOFTWARE ENGINEERING

Journal of Functional Programming Pub Date : 2023-11-22 DOI:10.1017/s0956796823000084

WOUTER SWIERSTRA

引用次数: 0

摘要

这个珍珠定义了从类型良好的lambda术语到组合逻辑的转换，在组合逻辑中，类型的保存和转换的正确性都是静态执行的。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

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

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.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Journal of Functional Programming 工程技术-计算机：软件工程

CiteScore

1.70

自引率

0.00%

发文量

审稿时长

>12 weeks

期刊介绍： Journal of Functional Programming is the only journal devoted solely to the design, implementation, and application of functional programming languages, spanning the range from mathematical theory to industrial practice. Topics covered include functional languages and extensions, implementation techniques, reasoning and proof, program transformation and synthesis, type systems, type theory, language-based security, memory management, parallelism and applications. The journal is of interest to computer scientists, software engineers, programming language researchers and mathematicians interested in the logical foundations of programming.