The theory of call-by-value solvability

The semantics of the untyped (call-by-name) lambda-calculus is a well developed field built around the concept of solvable terms, which are elegantly characterized in many different ways. In particular, unsolvable terms provide a consistent notion of meaningless term. The semantics of the untyped ca...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Proceedings of ACM on programming languages 2022-08, Vol.6 (ICFP), p.855-885
Hauptverfasser:	Accattoli, Beniamino, Guerrieri, Giulio
Format:	Artikel
Sprache:	eng
Schlagworte:	Computer Science Logic in Computer Science
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!