Wellfounded recursion with copatterns
From MaRDI portal
Publication:5244799
DOI10.1145/2500365.2500591zbMath1323.68087OpenAlexW2085552917MaRDI QIDQ5244799
Andreas Abel, Brigitte Pientka
Publication date: 30 March 2015
Published in: Proceedings of the 18th ACM SIGPLAN international conference on Functional programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/2500365.2500591
Functional programming and lambda calculus (68N18) Logic in computer science (03B70) Data structures (68P05)
Related Items (17)
Unnamed Item ⋮ Unnamed Item ⋮ Classical (co)recursion: Mechanics ⋮ Elaborating dependent (co)pattern matching: No pattern left behind ⋮ Doo bee doo bee doo ⋮ Polarized subtyping ⋮ Interactive programming in Agda – Objects and graphical user interfaces ⋮ Unnamed Item ⋮ A model of guarded recursion with clock synchronisation ⋮ Denotational semantics for guarded dependent type theory ⋮ How to Reason Coinductively Informally ⋮ Unnamed Item ⋮ Compositional Coinduction with Sized Types ⋮ Guarded Dependent Type Theory with Coinductive Types ⋮ Corecursion and Non-divergence in Session-Typed Processes ⋮ A case study in programming coinductive proofs: Howe’s method ⋮ Unnamed Item
Uses Software
This page was built for publication: Wellfounded recursion with copatterns
