Skip to main content
Conference ProceedingsOPEN ACCESS

Composing proof terms

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2019) 11716 LNAI 337-353
DOI: 10.1007/978-3-030-29436-6_20
1Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Proof terms are a useful concept for comparing computations in term rewriting. We analyze proof terms with composition, with an eye towards automation. We revisit permutation equivalence and projection equivalence, two key notions presented in the literature. We report on the integration of proof terms with composition into ProTeM, a tool for manipulating proof terms.

Author supplied keywords

Cite

CITATION STYLE

APA

Kohl, C., & Middeldorp, A. (2019). Composing proof terms. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11716 LNAI, pp. 337–353). Springer. https://doi.org/10.1007/978-3-030-29436-6_20

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free