Classical logic with Mendler induction-Reference-Cited by-同舟云学术

Classical logic with Mendler induction

Published:2020-01 Issue:1 Volume:30 Page:77-106
ISSN:0955-792X
Container-title:Journal of Logic and Computation
language:en
Short-container-title:

Author:

Devesas Campos Marco¹,Fiore Marcelo¹

Affiliation:

1. Department of Computer Science and Technology, University of Cambridge, CB3 0FD Cambridge, United Kingdom

Abstract

AbstractWe investigate (co-) induction in classical logic under the propositions-as-types paradigm, considering propositional, second-order and (co-) inductive types. Specifically, we introduce an extension of the Dual Calculus with a Mendler-style (co-) iterator and show that it is strongly normalizing. We prove this using a reducibility argument.

Publisher

Oxford University Press (OUP)

Subject

Logic,Hardware and Architecture,Arts and Humanities (miscellaneous),Software,Theoretical Computer Science

Link

http://academic.oup.com/logcom/article-pdf/30/1/77/33016434/exaa004.pdf

Reference22 articles.

1. Iteration and coiteration schemes for higher-order and nested datatypes;Abel;Theoretical Computer Science,2005

2. A hierarchy of Mendler style recursion combinators: taming inductive datatypes with negative occurrences;Ahn,2011

3. A symmetric lambda calculus for classical program extraction;Barbanera;Information and Computation,1996

4. ‘Classical’ programming-with-proofs in $\lambda ^{Sym}_{PA}$. An analysis of non-confluence;Barbanera,1997

5. A formulae-as-types interpretation of subtractive logic;Crolard;Journal of Logic and Computation,2004

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

1. Categorical models of Linear Logic with fixed points of formulas;2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS);2021-06-29