Specifying theorem provers in a higher-order logic programming language-Reference-Cited by-同舟云学术

Specifying theorem provers in a higher-order logic programming language

Published: Issue: Volume: Page:61-80
ISSN:
Container-title:9th International Conference on Automated Deduction
language:
Short-container-title:

Author:

Felty Amy,Miller Dale

Publisher

Springer-Verlag

Link

http://link.springer.com/content/pdf/10.1007/BFb0012823.pdf

Reference21 articles.

1. Arnon Avron, Furio A. Honsell, and Ian A. Mason. Using Typed Lambda Calculus to Implement Formal Systems on a Machine. Technical Report ECS-LFCS-87-31, Laboratory for the Foundations of Computer Science, University of Edinburgh, June 1987.

2. W. W. Bledsoe. Non-resolution theorem proving. Artificial Intelligence, 9:1–35, 1977.

3. W. W. Bledsoe. The UT Prover. Technical Report ATP-17B, University of Texas at Austin, April 1983.

4. R. L. Constable et al. Implementing Mathematics with the Nuprl Proof Development System. Prentice-Hall, 1986.

5. Alonzo Church. A formulation of the simple theory of types. Journal of Symbolic Logic, 5:56–68, 1940.

Cited by 43 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Higher-Order unification for free!: Reusing the meta-language unification for the object language;Proceedings of the 26th International Symposium on Principles and Practice of Declarative Programming;2024-09-09

2. A system of inference based on proof search: an extended abstract;2023 38th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS);2023-06-26

3. Implementing type theory in higher order constraint logic programming;Mathematical Structures in Computer Science;2019-03-01

4. Mechanized Metatheory Revisited;Journal of Automated Reasoning;2018-10-04

5. Implementing HOL in an Higher Order Logic Programming Language;Proceedings of the Eleventh Workshop on Logical Frameworks and Meta-Languages: Theory and Practice;2016-06-23