Small Induction Recursion

DOI10.1007/978-3-642-38946-7_13zbMath1381.68189DBLPconf/tlca/HancockMGMA13OpenAlexW2395623455WikidataQ61583738 ScholiaQ61583738MaRDI QIDQ5300900

Thorsten Altenkirch, Lorenzo Malatesta, Conor McBride, Peter G. Hancock, Neil Ghani

Publication date: 28 June 2013

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-38946-7_13

Mathematics Subject Classification ID

Abstract data types; algebraic specification (68Q65)

Related Items (7)

Turing-Completeness Totally Free ⋮ Subtyping without reduction ⋮ Indexed containers ⋮ Interactive programming in Agda – Objects and graphical user interfaces ⋮ Constructing a universe for the setoid model ⋮ How to Reason Coinductively Informally ⋮ Unnamed Item

This page was built for publication: Small Induction Recursion