Strong Call-by-Value is Reasonable, Implosively

Whether the number of β -steps in the λ-calculus can be taken as a reasonable time cost model (that is, polynomially related to the one of Turing machines) is a delicate problem, which depends on the notion of evaluation strategy. Since the nineties, it is known that weak (that is, out of abstractio...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science S. 1 - 14
Hauptverfasser:	Accattoli, Beniamino, Condoluci, Andrea, Coen, Claudio Sacerdoti
Format:	Tagungsbericht
Sprache:	Englisch
Veröffentlicht:	IEEE 29.06.2021
Schlagworte:	Computer science Turing machines
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!