An algorithmic interpretation of a deep inference system

11Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We set out to find something that corresponds to deep inference in the same way that the lambda-calculus corresponds to natural deduction. Starting from natural deduction for the conjunction-implication fragment of intuitionistic logic we design a corresponding deep inference system together with reduction rules on proofs that allow a fine-grained simulation of beta-reduction. © 2008 Springer Berlin Heidelberg.

Cite

CITATION STYLE

APA

Brünnler, K., & McKinley, R. (2008). An algorithmic interpretation of a deep inference system. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5330 LNAI, pp. 482–496). https://doi.org/10.1007/978-3-540-89439-1_34

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