|
729
|
A formulation of the simple theory of types
– A Church
- 1940
|
|
634
|
A Framework for Defining Logics
– Robert Harper , Furio Honsell, Gordon Plotkin
- 1993
|
|
417
|
The calculus of constructions
– T COQUAND, G P HUET
- 1988
|
|
62
|
Specifying theorem provers in a higher-order logic programming language
– A Felty, D Miller
- 1988
|
|
70
|
Elf: A Language for Logic Definition and Verified Metaprogramming
– Frank Pfenning
- 1989
|
|
78
|
Using Typed Lambda Calculus to Implement Formal Systems on a Machine
– Arnon Avron, Furio Honsell, Ian A. Mason, Robert Pollack
- 1992
|
|
97
|
A unification algorithm for typed λ-calculus
– G P Huet
- 1975
|
|
43
|
Specifying and Implementing Theorem Provers in a Higher-Order Logic Programming Language
– Amy Felty
- 1989
|
|
271
|
A logic programming language with lambda-abstraction, function variables, and simple unification
– Dale Miller
- 1990
|
|
332
|
Prudent Engineering Practice for Cryptographic Protocols
– Martin Abadi, Roger Needhamt
- 1994
|
|
138
|
Proving Properties of Security Protocols by Induction
– Lawrence C. Paulson
- 1997
|
|
6
|
On Two Formal Analyses of the Yahalom Protocol
– L C Paulson
- 1997
|
|
548
|
Breaking and Fixing the Needham-Schroeder Public-Key Protocol using FDR
– Gavin Lowe
- 1996
|
|
1040
|
A logic of authentication
– Michael Burrows, Martín Abadi, Roger Needham
- 1990
|
|
279
|
An Introduction to Mathematical Logic and Type Theory: To Truth Through Proof
– Peter B Andrews
- 1986
|
|
209
|
Investigations into logical deduction
– G Gentzen
- 1969
|
|
62
|
Lexical scoping as universal quantification
– Dale Miller
- 1989
|
|
99
|
The π-calculus as a theory in linear logic: Preliminary results
– Dale Miller
- 1993
|
|
933
|
Bigraphs and Mobile Processes
– Ole Høgh Jensen, Robin Milner
- 2003
|
