Computation by interaction for space-bounded functional programming

When programming with sublinear space constraints one often needs to use special implementation techniques even for simple tasks, such as function composition. In this paper, we study how such implementation techniques can be supported in a functional programming language. Our approach is based on m...

Celý popis

Podrobná bibliografia

Vydané v:	Information and computation Ročník 248; s. 150 - 194
Hlavní autori:	Dal Lago, Ugo, Schöpp, Ulrich
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier Inc 01.06.2016 Elsevier
Predmet:	Computer Science Functional programming Geometry of interaction Implicit computational complexity Logarithmic space Logic in Computer Science Type system Type system Logarithmic space Geometry of interaction Functional programming Implicit computational complexity
ISSN:	0890-5401, 1090-2651
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!