The untyped stack calculus and Bohm's theorem
Abstract
The stack calculus is a functional language in which is in a CurryHoward correspondence with classical logic. It enjoys confluence but, as well as Parigot's lambdamu, does not admit the Bohm Theorem, typical of the lambdacalculus. We present a simple extension of stack calculus which is for the stack calculus what Saurin's Lambdamu is for lambdamu.
 Publication:

arXiv eprints
 Pub Date:
 March 2013
 arXiv:
 arXiv:1303.7330
 Bibcode:
 2013arXiv1303.7330C
 Keywords:

 Computer Science  Logic in Computer Science;
 F.4.1;
 F.3.2
 EPrint:
 In Proceedings LSFA 2012, arXiv:1303.7136