The stack calculus

Alberto Carraro
(PPS, Université Paris Diderot)
Thomas Ehrhard
(PPS, Université Paris Diderot)
Antonino Salibra
(DAIS, Università Ca' Foscari Venezia)

We introduce a functional calculus with simple syntax and operational semantics in which the calculi introduced so far in the Curry-Howard correspondence for Classical Logic can be faithfully encoded. Our calculus enjoys confluence without any restriction. Its type system enforces strong normalization of expressions and it is a sound and complete system for full implicational Classical Logic. We give a very simple denotational semantics which allows easy calculations of the interpretation of expressions.

In Delia Kesner and Petrucio Viana: Proceedings Seventh Workshop on Logical and Semantic Frameworks, with Applications (LSFA 2012), Rio de Janeiro, Brazil, September 29-30, 2012, Electronic Proceedings in Theoretical Computer Science 113, pp. 93–108.
Published: 28th March 2013.

ArXived at: http://dx.doi.org/10.4204/EPTCS.113.10 bibtex PDF
References in reconstructed bibtex, XML and HTML format (approximated).
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org