Results 1 -
4 of
4
Natural Deduction as Higher-Order Resolution
- Journal of Logic Programming
, 1986
"... An interactive theorem prover, Isabelle, is under development. In LCF, each inference rule is represented by one function for forwards proof and another (a tactic) for backwards proof. In Isabelle, each inference rule is represented by a Horn clause. ..."
Abstract
-
Cited by 51 (8 self)
- Add to MetaCart
An interactive theorem prover, Isabelle, is under development. In LCF, each inference rule is represented by one function for forwards proof and another (a tactic) for backwards proof. In Isabelle, each inference rule is represented by a Horn clause.
A mechanical formalization of several fairness notions
- VDM ’91: Formal Software Development Methods. Springer-Verlag Lecture Notes in Computer Science 551
, 1991
"... The views and conclusions contained in this document are those of the author and should not be interpreted as representing the official policies, either expressed or ..."
Abstract
-
Cited by 3 (1 self)
- Add to MetaCart
The views and conclusions contained in this document are those of the author and should not be interpreted as representing the official policies, either expressed or
