The untyped stack calculus and Bohm's theorem
Logic in Computer Science
2013-04-01 v1
Abstract
The stack calculus is a functional language in which is in a Curry-Howard correspondence with classical logic. It enjoys confluence but, as well as Parigot's lambda-mu, does not admit the Bohm Theorem, typical of the lambda-calculus. We present a simple extension of stack calculus which is for the stack calculus what Saurin's Lambda-mu is for lambda-mu.
Keywords
Cite
@article{arxiv.1303.7330,
title = {The untyped stack calculus and Bohm's theorem},
author = {Alberto Carraro},
journal= {arXiv preprint arXiv:1303.7330},
year = {2013}
}
Comments
In Proceedings LSFA 2012, arXiv:1303.7136