Inductive invariants for nested recursion (2003)

by Sava Krstić , John Matthews
Venue:Theorem Proving in Higher Order Logics (TPHOLS'03), volume 2758 of LNCS
Citations:5 - 2 self

Documents Related by Co-Citation

795 Isabelle/HOL: A Proof Assistant for Higher-Order Logic, volume 2283 – Tobias Nipkow, Lawrence C Paulson, Markus Wenzel - 2002
34 Reasoning about Terminating Functional Programs – K Slind - 1999
515 Interactive Theorem Proving and Program Development. Coq’Art: The Calculus of Inductive Constructions. Texts in Theoretical Computer Science. An EATCS series – Y Bertot, P Castéran - 2004
548 A Computational Logic – R S Boyer, J S Moore - 1979
1353 Monads for functional programming – Philip Wadler - 1995
497 The calculus of constructions – T Coquand, G P Huet - 1988
11 A Step Towards the Mechanization of Partial Functions: Domains as Inductive Predicates – Catherine Dubois, Véronique Viguié Donzeau-Gouge - 1998
10 Treating partiality in a logic of total functions – Olaf Müller, Konrad Slind - 1997
244 The Formal Semantics of Programming Languages: an Introduction – G Winskel - 1993