Documents Related by Co-Citation

469 Interactive theorem proving and program development: Coq’Art: The calculus of inductive constructions – Y Bertot, P Castéran - 2004
439 Computational Lambda-Calculus and Monads – Eugenio Moggi - 1988
724 M.: Isabelle/HOL - A Proof Assistant for HigherOrder Logic – T Nipkow, L C Paulson, Wenzel - 2002
4 A logical framework for software proof reuse – Joshua E. Caplan, Mehdi T. Harandi - 1995
4 Developing Reuse Technology in Proof Engineering – Zhaohui Luo - 1995
3 Proof Generalization and Proof Reuse – Olivier Pons, Inria Sophia Antipolis
4 Proof reuse with extended inductive types – O Boite - 2004
15 The Fifteen Provers of the World – Freek Wiedijk - 2002
33 Order-sorted polymorphism in isabelle – Tobias Nipkow, Tu München - 1993
19 The HOL logic extended with quantification over type variables – Thomas F. Melham - 1993
37 Locales and locale expressions in Isabelle/Isar – Clemens Ballarin - 2004
69 Type Classes and Overloading in Higher-Order Logic – Markus Wenzel, Technische Universität München - 1997
4 Abstracting Refinements for Transformation – Einar Broch Johnsen, Christoph Lüth - 2003
8 A Proof Assistant for Higher-Order Logic – T Nipkow, L C Paulson, M Wenzel - 2002
10 Monad-independent Hoare Logic in HasCasl – Lutz Schröder, Till Mossakowski - 2003
19 Combining Computational Effects: Commutativity and Sum – Martin Hyland, Gordon Plotkin, John Power - 2002
96 How to Declare an Imperative – Philip Wadler - 1995
23 Composing Monads Using Coproducts – Christoph Lüth, Neil Ghani - 2002
45 A unified treatment of transfinite constructions for free algebras, free monoids, colimits, associated sheaves, and so – G M Kelly