Bob Boyer
- {BM}R. S. Boyer and J. S. Moore, A Computational Logic, Academic Press, New York, 1984.Google Scholar
- {GMW}M. J. Gordon, A. J. Milner, and C. P. Wadsworth, Edinburgh LCF, Lec. notes. Comp. Sci. 78, Springer-Verlag, 1979.Google Scholar
- {K}M. Kaufmann, A direct construction of a SASL domain, Burroughs Austin Research Center, 1984.Google Scholar
- {M}J. McCarthy, P. W. Abrahams, D. J. Edwards, T. P. Hart, and M. I. Levin, LISP 1.5 Programmer's Manual, MIT Press, Cambridge, Massachusetts, 1965. Google ScholarDigital Library
- {R1}H. Richards, An overview of ARC SASL, SIGPLAN Notices 19 (October 1984), pp. 40-45. Google ScholarDigital Library
- {R2}H. Richards, Programming in SASL, Burroughs Austin Research Center, 1984.Google Scholar
- {T1}D. A. Turner, SASL Language Manual, Computer Laboratory, University of Kent, Canterbury, U.K., 1976 (revised 1979).Google Scholar
- {T2}D. A. Turner, Functional programming and proofs of program correctness, in: Neel (ed.), Tools and Notions for Program Construction, Cambridge University Press, Cambridge, 1982.Google Scholar
Recommendations
Implementing a Program Logic of Objects in a Higher-Order Logic Theorem Prover
TPHOLs '00: Proceedings of the 13th International Conference on Theorem Proving in Higher Order LogicsWe present an implementation of a program logic of objects, extending that (AL) of Abadi and Leino. In particular, the implementation uses higher-order abstract syntax (HOAS) and--unlike previous approaches using HOAS--at the same time uses the built-in ...
The Higher-Order Prover Leo-II
Leo-II is an automated theorem prover for classical higher-order logic. The prover has pioneered cooperative higher-order---first-order proof automation, it has influenced the development of the TPTP THF infrastructure for higher-order logic, and it has ...
Comments