Extending the TPTP Language to Higher-Order Logic with Automated Parser Generation-Reference-Cited by-同舟云学术

Extending the TPTP Language to Higher-Order Logic with Automated Parser Generation

Published:2006 Issue: Volume: Page:156-161
ISSN:0302-9743
Container-title:Automated Reasoning
language:
Short-container-title:

Author:

Van Gelder Allen,Sutcliffe Geoff

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/11814771_15

Reference9 articles.

1. Benzmüller, C., Brown, C.: A Structured Set of Higher-Order Problems. In: Proc. 18th Theorem Proving in Higher Order Logics, pp. 66–81 (2005)

2. Felty, D., et al.: The Coq Proof Assistant, http://pauillac.inria.fr/coq

3. Forsberg, M., Ranta, A.: The Labelled BNF Grammar Formalism. Technical report, Chalmers, Gothenburg, Sweden (2005), http://www.cs.chalmers.se/~markus/BNFC

4. Harper, R., Honsell, F., Plotkin, G.: A Framework for Defining Logics. Journal of the ACM 40(1), 143–184 (1993)

5. Hudak, P.: Conception, Evolution, and Application of Functional Programming Languages. ACM Computing Surveys 21, 359–411 (1989)

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

1. Stepping Stones in the TPTP World;Lecture Notes in Computer Science;2024

2. Measuring Plagiarism in Introductory Programming Course Assignments;2022 8th International Conference on Information Technology Trends (ITT);2022-05-25

3. The TPTP Problem Library and Associated Infrastructure;Journal of Automated Reasoning;2017-02-17

4. HOL(y)Hammer: Online ATP Service for HOL Light;Mathematics in Computer Science;2014-06-28

5. Learning-Assisted Automated Reasoning with Flyspeck;Journal of Automated Reasoning;2014-06-01