Containers, monads and induction recursion

DOI10.1017/S0960129514000127zbMath1361.68039OpenAlexW2035713914MaRDI QIDQ5741557

Neil Ghani, Peter G. Hancock

Publication date: 28 July 2016

Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0960129514000127

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18)

Related Items (2)

Turing-Completeness Totally Free ⋮ Variations on inductive-recursive definitions

Cites Work

• Unnamed Item
• Propositional functions and families of types
• Inductive families
• Induction-recursion and initial algebras.
• Containers: Constructing strictly positive types
• Indexed induction-recursion
• A Brief Overview of Agda – A Functional Language with Dependent Types
• A general formulation of simultaneous inductive-recursive definitions in type theory
• Two applications of analytic functors

This page was built for publication: Containers, monads and induction recursion