34

Deductive Synthesis of the Unification Algorithm
– Z Manna, R Waldinger
 1981

218

Unification revisited
– J Lassez, M Maher, K Marriott
 1986

26

A rational reconstruction and extension of recursion analysis
– Alan Bundy, Frank Van Harmelen, Jane Hesketh, Alan Smaill, Andrew Stevens
 1989

530

A computational logic
– Robert S Boyer, J Strother Moore
 1979

3

Synthesis of a unification algorithm in a logic programming calculus
– LH Eriksson
 1984

3

Formal synthesis of a unification algorithm by the deductivetableau method
– D Nardi
 1989

154

A deductive approach to program synthesis
– Z Manna, R Waldinger
 1980

945

A machineoriented logic based on the resolution principle
– John Alan Robinson
 1965

8

Domain Theory in HOL
– S Agerholm
 1993

2

Lessons Learned from LCF
– L C Paulson
 1984

5

Graph Model of LAMBDA in Higher Order Logic
– K D Petersen
 1993

12

Mechanizing program verification in HOL
– S Agerholm
 1991

74

Automating Recursive Type Definitions in Higher Order Logic
– Thomas Melham
 1988

6

Deriving structural induction in LCF
– Lawrence Paulson
 1984

239

The Formal Semantics of Programming Languages
– G Winskel
 1993

130

Edinburgh LCF: A mechanised logic of computation
– M Gordon, R Milner, C Wadsworth
 1979

165

Logic and Computation: Interactive Proof with Cambridge LCF
– L Paulson
 1987

1562

The Definition of Standard ML
– Robin Milner, Mads Tofte
 1990

43

Introduction to HOL: a theoremproving environment for higherorder logic
– M J C Gordon, T F Melham
 1993
