Access the full text.
Sign up today, get DeepDyve free for 14 days.
M. Gordon (1988)
HOL: A Proof Generating System for Higher-Order Logic
R. Harper, F. Honsell, G. Plotkin (1993)
A framework for defining logicsJ. ACM, 40
Furio, Honselly, Gordon, PlotkinzAbstractThe (1987)
A Framework for De ning LogicsRobert Harper
The variable b cannot be assigned a term containing y f a; b g , for this constant contains b
P. Martin-Löf (1996)
On the meanings of the logical constants and the justi cations of the logical laws
(1988)
VLSI Speciﬂcation, Veriﬂca-tion and Synthesis
(1987)
Proof Theory (second edition)
D. Prawitz (1965)
Natural Deduction: A Proof-Theoretical Study
Lawrence Paulson (1986)
Natural Deduction as Higher-Order ResolutionJ. Log. Program., 3
A. Avron, F. Honsell, Ian Mason, R. Pollack (1992)
Using typed lambda calculus to implement formal systems on a machineJournal of Automated Reasoning, 9
Lawrence Paulson (1987)
Logic and computation - interactive proof with Cambridge LCF, 2
J. Lambek, P. Scott (1986)
Introduction to higher order categorical logic
Peter etc (1999)
HANDBOOK OF MATHEMATICAL LOGIC
R. Constable, S. Allen, Mark Bromley, R. Cleaveland, J. Cremer, R. Harper, Douglas Howe, Todd Knoblock, N. Mendler, P. Panangaden, James Sasaki, Scott Smith (1986)
Implementing mathematics with the Nuprl proof development system
D. Prawitz (1971)
Ideas and Results in Proof TheoryStudies in logic and the foundations of mathematics, 63
Lawrence Paulson (1988)
A preliminary users manual for Isabelle
Each proposition A is interpreted as the type (or set) A of proof objects, and A is true if it has a proof object
H. Curry, J. Hindley, J. Seldin (1980)
To H.B. Curry: Essays on Combinatory Logic, Lambda Calculus, and Formalism
(1962)
Principia Mathematica, Paperback edition to *56
J. Hindley, J. Seldin (1986)
Introduction to combinators and l-calculus
A. Pitts (1987)
INTRODUCTION TO HIGHER ORDER CATEGORICAL LOGIC (Cambridge Studies in Advanced Mathematics 7)Bulletin of The London Mathematical Society, 19
Bengt Nordström, Jan Smith (1984)
Propositions and specifications of programs in Martin-Löf's type theoryBIT Numerical Mathematics, 24
G. Huet (1975)
A Unification Algorithm for Typed lambda-CalculusTheor. Comput. Sci., 1
J. Shepherdson, C. Hoare (1985)
Mathematical Logic and Programming Languages
(1987)
How I spent my time in Cambridge with Isabelle
W. Howard (1969)
The formulae-as-types notion of construction
Peter Andrews (1986)
An introduction to mathematical logic and type theory - to truth through proof
P. Schroeder-Heister (1984)
Generalized rules for quantifiers and the completeness of the intuitionistic operators &, ν, ⊃, λ, ∀, ε
P. Martin-Lof (1986)
ON THE MEANINGS OF THE LOGICAL CONSTANTS AND THE JUSTIFICATIONS OF THE LOGICAL LAWS(Logic and the Foundations of Mathematics), 588
The so-called 'dependent product' or "dependent function space
P. Schroeder-Heister (1984)
A natural extension of natural deductionJournal of Symbolic Logic, 49
T. Coquand, G. Huet (1985)
Constructions: A Higher Order Proof System for Mechanizing Mathematics
P. Martin-Löf (1984)
Constructive mathematics and computer programmingStudies in logic and the foundations of mathematics, 104
F. Dick (1980)
A survey of the project Automath
A. Felty, D. Miller (1988)
Specifying Theorem Provers in a Higher-Order Logic Programming Language
van Jutting (1994)
Checking Landau's “Grundlagen” in the Automath System: Parts of Chapter 3 (Verification)Studies in logic and the foundations of mathematics, 133
(1988)
editors
(1985)
What Is Automated Theorem Proving?J. Autom. Reason., 1
@BULLET A proof object of A v B contains either a proof object of A or else a proof object of B, and an indication of which. Thus A x/ B is interpreted as the disjoint union
G. P. Huet (1975)
A unification algorithm for typed λ-calculusTheoretical Computer Science, 1
J. Barwise (1977)
An Introduction to First-Order LogicStudies in logic and the foundations of mathematics, 90
(1986)
Amendment to intuitionistic type theory
R. Milner (1984)
The use of machines to assist in rigorous proofPhilosophical Transactions of the Royal Society of London. Series A, Mathematical and Physical Sciences, 312
Lawrence Paulson (1987)
Logic And Computation
T. Coquand, G. Huet (1988)
The Calculus of ConstructionsInf. Comput., 76
G. Huet, B. Lang (1978)
Proving and applying program transformations expressed with second-order patternsActa Informatica, 11
Peter Andrews, D. Miller, E. Cohen, F. Pfenning (1984)
AUTOMATING HIGHER-ORDER LOGIC
D. Bruijn (1980)
A survey of the project AutomathStudies in logic and the foundations of mathematics, 133
Isabelle [28, 30] is an interactive theorem prover that supports a variety of logics. It represents rules as propositions (not as functions) and builds proofs by combining rules. These operations constitute a meta-logic (or ‘logical framework’) in which the object-logics are formalized. Isabelle is now based on higher-order logic-a precise and well-understood foundation.
Journal of Automated Reasoning – Springer Journals
Published: Aug 3, 2004
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.