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...

Celý popis

Podrobná bibliografia

Vydané v:	Science of computer programming Ročník 84; s. 77 - 100
Hlavní autori:	Dal Lago, Ugo, Petit, Barbara
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier B.V 01.05.2014 Elsevier
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!