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.

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Journal of functional programming Jg. 33
1. Verfasser: SWIERSTRA, WOUTER
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Cambridge, UK Cambridge University Press 22.11.2023
Schlagworte:
Calculus
Functional Pearl
Semantics
Variables
ISSN:0956-7968, 1469-7653
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
Bibliographie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0956-7968
1469-7653
DOI:10.1017/S0956796823000084