Interaction trees: representing recursive and impure programs in Coq

Interaction trees (ITrees) are a general-purpose data structure for representing the behaviors of recursive programs that interact with their environments. A coinductive variant of “free monads,” ITrees are built out of uninterpreted events and their continuations. They support compositional constru...

Celý popis

Podrobná bibliografia

Vydané v:	Proceedings of ACM on programming languages Ročník 4; číslo POPL; s. 1 - 32
Hlavní autori:	Xia, Li-yao, Zakowski, Yannick, He, Paul, Hur, Chung-Kil, Malecha, Gregory, Pierce, Benjamin C., Zdancewic, Steve
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	ACM 01.01.2020
Predmet:	Computer Science Programming Languages
ISSN:	2475-1421, 2475-1421
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!