|
14
|
Proving Termination of Normalization Functions for Conditional Expressions
– Lawrence C Paulson
- 1986
|
|
8
|
A Survey of Formal Software Development Methods
– Donald Sannella
- 1988
|
|
14
|
Program verification
– Robert S. Boyer, J Strother Moore
- 1985
|
|
18
|
Constructing Recursion Operators in Intuitionistic Type Theory
– Lawrence C Paulson
- 1984
|
|
8
|
Models for Persistence in Lazy Functional Programming Systems
– David John McNally, Ky Ss, Tony Davie, Al Dearle, Simon Peyton Jones, Stef Joosten, Graham Kirby
- 1993
|
|
12
|
LCF Examples in HOL
– Sten Agerholm, Sten Agerholm
- 1994
|
|
23
|
A HOL basis for reasoning about functional programs
– Sten Agerholm
- 1994
|
|
5
|
Induction Proofs with Partial Functions
– Jürgen Giesl
- 1998
|
|
15
|
Mechanizing set theory: Cardinal arithmetic and the axiom of choice
– Lawrence C. Paulson, Krzysztof Grabczewski
- 1996
|
|
40
|
Set Theory for Verification: II - Induction and Recursion
– Lawrence C. Paulson
- 2000
|
|
22
|
A Theorem Prover for a Computational Logic
– Robert S. Boyer, J Strother Moore
- 1990
|
|
27
|
The Boyer-Moore Theorem Prover and Its Interactive Enhancement
– Robert S. Boyer, Matt Kaufmann, J Strother Moore
- 1995
|
|
|
Formalizing abstraction mechanisms . . .
– Thomas Frederick Melham
- 1990
|
|
2
|
Decidability Extracted: Synthesizing ``Correct-by-Construction'' Decision Procedures from Constructive Proofs
– James L. Caldwell
- 1998
|
|
7
|
Designing a Theorem Prover
– Lawrence C Paulson
- 1990
|
|
62
|
Fundamentals Of Deductive Program Synthesis
– Zohar Manna, Richard Waldinger
- 1992
|
|
|
Lambda-Calculus and Functional Programming
– Jonathan P. Seldin
|
|
1
|
Should ML be object-oriented?
– David MacQueen
|
|
93
|
Experiments with Proof Plans for Induction
– Alan Bundy, Frank van Harmelen, Jane Hesketh, Alan Smaill
- 1992
|
