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á bibliografie

Vydáno v:	Information and computation Ročník 248; s. 150 - 194
Hlavní autoři:	Dal Lago, Ugo, Schöpp, Ulrich
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Elsevier Inc 01.06.2016 Elsevier
Témata:	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 přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!