A Broader Class of Trees for Recursive Type Definitions for HOL (1994)

Cached

Download Links

by Elsa L. Gunter
Venue:Higher Order Logic Theorem Proving and Its Applications, volume 780 of LNCS
Citations:13 - 0 self

Documents Related by Co-Citation

69 Automating Recursive Type Definitions in Higher Order Logic – Thomas Melham - 1988
30 Inductive datatypes in HOL - lessons learned in Formal-Logic Engineering – Stefan Berghofer, Markus Wenzel - 1999
38 Mechanizing Coinduction and Corecursion in Higher-order Logic – Lawrence C. Paulson - 1997
40 Reasoning with inductively defined relations in the HOL theorem prover – J Camilleri, T F Melham - 1992
20 Inductive definitions: Automation and application – J Harrison - 1995
728 A formulation of the simple theory of types – A Church - 1940
18 Categorical models for Abadi and Plotkin’s logic for parametricity – L Birkedal, R E Møgelberg - 2005
325 Proofs and Types – J-Y Girard, Y Lafont, P Taylor - 1989
208 Abstract and Concrete Categories – J Adámek, H Herrlich, G Strecker - 1990
184 Melham, editors. Introduction to HOL: A Theorem Proving Environment for Higher Order Logic – M J C Gordon, T F - 1993
27 HOL: A Proof Generating System for Higher Order Logic – M J C Gordon - 1989
15 Proof Principles for Datatypes with Iterated Recursion – Ulrich Hensel, Bart Jacobs - 1997
40 A Co-induction Principle for Recursively Defined Domains – Andrew Pitts
157 Logic and Computation: Interactive proof with Cambridge LCF – Lawrence C Paulson - 1987
20 Wellfounded Trees and Dependent Polynomial Functors – Nicola Gambino, Martin Hyland - 2004
16 Extracting a Proof of Coherence for Monoidal Categories from a Proof of Normalization for Monoids – Ilya Beylin, Peter Dybjer - 1995
16 Relators and metric bisimulations – J J M M Rutten - 1998
6 A Design Structure for Higher Order Quotients – Peter V. Homeier - 2005
14 Indexed Containers – Thorsten Altenkirch, Neil Ghani, Peter Hancock, Conor Mcbride, Peter Morris