Linear dependent types in a call-by-value scenario

Linear dependent types were introduced recently (Dal Lago and Gaboardi, 2012) [26] as a formal system that allows to precisely capture both the extensional behavior and the time complexity of λ-terms, when the latter are evaluated by Krivine’s abstract machine. In this work, we show that the same pa...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Science of computer programming Jg. 84; S. 77 - 100
Hauptverfasser:	Dal Lago, Ugo, Petit, Barbara
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Elsevier B.V 01.05.2014 Elsevier
Schlagworte:	Cognitive science Complexity analysis Computer science Implicit computational complexity Linear logic Type systems Linear logic Complexity analysis Type systems Implicit computational complexity
ISSN:	0167-6423, 1872-7964
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!