A coinductive representation of computable functions

DOI10.4230/LIPICS.CALCO.2025.7MaRDI QIDQ7298147zbMATH OpenFDO

Authors Alvin Tang, Dirk Pattinson

Publication date 16 July 2026

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.CALCO.2025.7

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• A Survey of Infinite Time Turing Machines
• A type theory for productive coprogramming via guarded recursion
• An invitation to general algebra and universal constructions.
• Foundational extensible corecursion: a proof assistant perspective
• Full abstraction in the lazy lambda calculus
• scientific article; zbMATH DE number 439891 (Why is no real title available?)
• scientific article; zbMATH DE number 3961577 (Why is no real title available?)
• scientific article; zbMATH DE number 51770 (Why is no real title available?)
• scientific article; zbMATH DE number 1343506 (Why is no real title available?)
• scientific article; zbMATH DE number 478433 (Why is no real title available?)
• scientific article; zbMATH DE number 1064116 (Why is no real title available?)
• scientific article; zbMATH DE number 1460545 (Why is no real title available?)
• Logical Approaches to Computational Barriers
• Partiality and recursion in interactive theorem provers -- an overview
• Productive coprogramming with guarded recursion
• Program equivalence is coinductive
• Theory of computation.
• Well-definedness and observational equivalence for inductive–coinductive programs

This page was built for publication: A coinductive representation of computable functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7298147)