Intuitionistic and classical natural deduction systems with the catch and the throw rules

Publisher： Elsevier

ISSN： 0304-3975

Source： Theoretical Computer Science, Vol.175, Iss.1, 1997-03, pp. : 75-92

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Least and greatest fixed points in intuitionistic natural deduction

By Uustalu

Theoretical Computer Science, Vol. 272, Iss. 1, 2002-02 ,pp. : 315-339

Elsevier

Access to resources Recommend Favorite

Relating Natural Deduction and Sequent Calculus for Intuitionistic Non-Commutative Linear Logic

By Polakow J. Pfenning F.

Electronic Notes in Theoretical Computer Science, Vol. 20, Iss. 1, 2004-01 ,pp. : 1-18

Elsevier

Access to resources Recommend Favorite

Completion of Rewrite Systems with Membership Constraints Part I: Deduction Rules

By Comon H.

Journal of Symbolic Computation, Vol. 25, Iss. 4, 1998-04 ,pp. : 397-419

Academic Press

Access to resources Recommend Favorite

Strong normalizability of the non-deterministic catch/throw calculi

By Kameyama Y. Sato M.

Theoretical Computer Science, Vol. 272, Iss. 1, 2002-02 ,pp. : 223-245

Elsevier

Access to resources Recommend Favorite

On the intuitionistic force of classical search

By Ritter E. Pym D. Wallen L.

Theoretical Computer Science, Vol. 232, Iss. 1, 2000-02 ,pp. : 299-333

Elsevier

Access to resources Recommend Favorite