Undecidability of higher-order unification formalised in Coq-Reference-Cited by-同舟云学术

Undecidability of higher-order unification formalised in Coq

Published:2020-01-20 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 9th ACM SIGPLAN International Conference on Certified Programs and Proofs
language:
Short-container-title:

Author:

Spies Simon¹,Forster Yannick¹

Affiliation:

1. Saarland University, Germany

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3372885.3373832

Reference48 articles.

1. Henk P. Barendregt. 1984. The Lambda Calculus: Its Syntax and Semantics (2nd revised ed.). North-Holland. Henk P. Barendregt. 1984. The Lambda Calculus: Its Syntax and Semantics (2nd revised ed.). North-Holland.

2. Mario Carneiro. 2018. Formalizing computability theory via partial recursive functions. arXiv preprint arXiv:1810.08380 (2018). Mario Carneiro. 2018. Formalizing computability theory via partial recursive functions. arXiv preprint arXiv:1810.08380 (2018).

3. Hilbert's Tenth Problem is Unsolvable

4. Lambda calculus notation with nameless dummies, a tool for automatic formula manipulation, with application to the Church-Rosser theorem

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

1. Formal Verification of Bit-Vector Invertibility Conditions in Coq;Frontiers of Combining Systems;2023

2. Trakhtenbrot's Theorem in Coq: Finite Model Theory through the Constructive Lens;Logical Methods in Computer Science;2022-06-14

3. Hilbert's Tenth Problem in Coq (Extended Version);Logical Methods in Computer Science;2022-03-01

4. Formalization of the Computational Theory of a Turing Complete Functional Language Model;Journal of Automated Reasoning;2022-01-30

5. Formal categorical reasoning;Turkish Journal of Mathematics;2022-01-01