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

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Proceedings of ACM on programming languages Jg. 4; H. POPL; S. 1 - 32
Hauptverfasser:	Xia, Li-yao, Zakowski, Yannick, He, Paul, Hur, Chung-Kil, Malecha, Gregory, Pierce, Benjamin C., Zdancewic, Steve
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	ACM 01.01.2020
Schlagworte:	Computer Science Programming Languages
ISSN:	2475-1421, 2475-1421
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!