A prototype theorem-prover for a higher-order functional language
![First page of PDF](/cms/10.1145/1012497.1012525/asset/87a19664-d4c6-429d-ae5e-c5fd6d5b1ce7/assets/1012497.1012525.fp.png)
References
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
Information & Contributors
Information
Published In
![cover image ACM SIGSOFT Software Engineering Notes](/cms/asset/711b5a5e-c8f2-4568-82e5-d2fb45c9f2cd/3709616.cover.jpg)
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Check for updates
Qualifiers
- Article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 226Total Downloads
- Downloads (Last 12 months)136
- Downloads (Last 6 weeks)8
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in