Foundational, Compositional (Co)datatypes for Higher-Order Logic -- Category Theory Applied to Theorem Proving

by Dmitriy Traytel , Andrei Popescu , Jasmin Christian Blanchette
Citations:8 - 4 self

Documents Related by Co-Citation

9 A purely definitional universal domain – B Huffman
42 Inductive datatypes in HOL - lessons learned in Formal-Logic Engineering – Stefan Berghofer, Markus Wenzel - 1999
2 Java and the Java memory model—A unified, machine-checked formalisation – A Lochbihler - 2012
18 Relators and metric bisimulations – J J M M Rutten - 1998
8 A Design Structure for Higher Order Quotients – Peter V. Homeier - 2005
16 Two applications of analytic functors – R Hasegawa - 2002
17 Proof Principles for Datatypes with Iterated Recursion – Ulrich Hensel, Bart Jacobs - 1997
78 Power domains – M B Smyth - 1978
22 Inductive definitions: automation and application – J Harrison - 1995
22 Indexed Containers – Thorsten Altenkirch, Neil Ghani, Peter Hancock, Conor Mcbride, Peter Morris
74 Automating Recursive Type Definitions in Higher Order Logic – Thomas Melham - 1988
16 A Broader Class of Trees for Recursive Type Definitions for HOL – Elsa L. Gunter - 1994
20 A Fixedpoint Approach to (Co)Inductive and (Co)Datatype Definitions – Lawrence C. Paulson - 1997
12 Proof Pearl: Regular Expression Equivalence and Relation Algebra – A Krauss, T Nipkow
298 Universal coalgebra: a theory of systems – J. J. M. M. Rutten - 2000
61 Containers - constructing strictly positive types, Theoretical Computer Science 342 (2005) 3–27, applied Semantics: Selected Topics – M Abott, T Altenkirch, N Ghani
4 A Predicative Strong Normalisation Proof for a lambda-Calculus with Interleaving Inductive Types – Andreas Abel, Thorsten Altenkirch - 2000
3 Modular Type-Safety Proofs in Agda – Christopher Schwaab, Jeremy G. Siek
702 Types and programming languages – Benjamin C Pierce - 2002