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

Full description

Bibliographic Details

Published in:	Proceedings of ACM on programming languages Vol. 4; no. POPL; pp. 1 - 32
Main Authors:	Xia, Li-yao, Zakowski, Yannick, He, Paul, Hur, Chung-Kil, Malecha, Gregory, Pierce, Benjamin C., Zdancewic, Steve
Format:	Journal Article
Language:	English
Published:	ACM 01.01.2020
Subjects:	Computer Science Programming Languages
ISSN:	2475-1421, 2475-1421
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!