|
43
|
Should Your Specification Language Be Typed?
– Leslie Lamport , Lawrence C. Paulson
- 1999
|
|
5
|
Tool Support for Logics of Programs
– Lawrence C. Paulson
- 1996
|
|
4
|
Isabelle’s isabelle’s logics: FOL and ZF
– Lawrence C. Paulson, Tobias Nipkow, Markus Wenzel
- 2003
|
|
|
α Isabelle’s Logics
– Lawrence C. Paulson, Tobias Nipkow, Markus Wenzel, Markus Wenzel, Sara Kalvala
- 2008
|
|
24
|
Generic Automatic Proof Tools
– Lawrence C. Paulson
- 1997
|
|
2
|
Proof-search in type-theoretic languages: an introduction
– Didier Galmiche, David J. Pym
- 2000
|
|
16
|
Higher Order Logic
– Daniel Leivant
- 1994
|
|
|
Formalizing abstraction mechanisms . . .
– Thomas Frederick Melham
- 1990
|
|
11
|
Un Calcul De Constructions Infinies Et Son Application A La Verification De Systemes Communicants
– Carlos Eduardo Giménez, Suprieure De Lyon, Spcialit Informatique, Par Carlos Eduardo Gimnez, De Systemes Communicants, Roberto Amadio, Roberto Amadio, Luc Boug, Thierry Coquand, Thierry Coquand, Michel Cosnard (president, Gilles Kahn
- 1996
|
|
15
|
Mechanizing set theory: Cardinal arithmetic and the axiom of choice
– Lawrence C. Paulson, Krzysztof Grabczewski
- 1996
|
|
6
|
Isabelle’s Logics: HOL
– Tobias Nipkow, Lawrence C. Paulson, Markus Wenzel
- 2008
|
|
7
|
Using Theory Morphisms for Implementing Formal Methods Tools
– Achim D. Brucker, Burkhart Wolff
- 2003
|
|
38
|
Mechanizing Coinduction and Corecursion in Higher-order Logic
– Lawrence C. Paulson
- 1997
|
|
18
|
Correct and User-Friendly Implementations of Transformation Systems
– Kolyang, T. Santen, B. Wolff
- 1996
|
|
|
Types for Proofs and Programs
– Bernd Grobauer
- 1999
|
|
|
Contents
– The Phragmén-lindelöf Theorem
- 2006
|
|
2
|
A Basic Extended Simple Type Theory
– William M. Farmer
- 2001
|
|
14
|
The Seven Virtues of Simple Type Theory
– William M. Farmer
- 2003
|
|
19
|
From LCF to HOL: a short history
– Mike Gordon
- 2000
|