Mechanizing Coinduction and Corecursion in Higher-order Logic (1997)

by Lawrence C. Paulson
Venue:Journal of Logic and Computation
Citations:41 - 5 self

Active Bibliography

20 A Fixedpoint Approach to (Co)Inductive and (Co)Datatype Definitions – Lawrence C. Paulson - 1997
5 Tool Support for Logics of Programs – Lawrence C. Paulson - 1996
24 From LCF to HOL: a short history – Mike Gordon - 2000
18 Higher Order Logic – Daniel Leivant - 1994
19 The Seven Virtues of Simple Type Theory – William M. Farmer - 2003
Desiderata for Interactive Verification Systems – Konrad Slind, Christian Prehofer - 1994
12 LCF Examples in HOL – Sten Agerholm, Sten Agerholm - 1994
2 An interpretation of isabelle/hol in hol light – Sean Mclaughlin
23 Formalized mathematics – John Harrison - 1996
23 A HOL basis for reasoning about functional programs – Sten Agerholm - 1994
The Triumph of Types: Principia Mathematica’s Impact on Computer Science – Robert L. Constable
24 HOLCF: Higher Order Logic of Computable Functions – Franz Regensburger - 1995
22 Isabelle's Object-Logics – Lawrence C. Paulson - 1997
Formalizing abstraction mechanisms . . . – Thomas Frederick Melham - 1990
2 A Basic Extended Simple Type Theory – William M. Farmer - 2001
12 An Overview of A Formal Framework For Managing Mathematics – William M. Farmer, Martin V. Mohrenschildt - 2003
23 The Amsterdam Manifesto on OCL – Steve Cook, Richard Mitchell, Bernhard Rumpe, Jos Warmer, Alan Wills, Klasse Objecten, Nl-ct Soest - 1999
37 Recursive Subtyping Revealed – Vladimir Gapeyev, Michael Levin, Benjamin Pierce - 2000
Verification de l'equivalence du pi-calcul dans HOL – Otmane Ait-mohamed, Otmane Ait-mohamed, Projet Eureca - 1994