1 citations · 1 across the 1 of their papers we have counts for
Showing 2019 · cs.PLShow all
2 papers · 2 filters
cs.PL2019
Interaction Trees: Representing Recursive and Impure Programs in Coq
Li-yao Xia, Yannick Zakowski, Paul He +4
"Interaction trees" (ITrees) are a general-purpose data structure for representing the behaviors of recursive programs that interact with their environments. A coinductive variant…
cs.PL2019★ 1 cited
Composing bidirectional programs monadically (with appendices)
Li-yao Xia, Dominic Orchard, Meng Wang
Software frequently converts data from one representation to another and vice versa. Naively specifying both conversion directions separately is error prone and introduces conceptu…