The stack calculus
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 normalizati...
Main Authors: | Alberto Carraro, Thomas Ehrhard, Antonino Salibra |
---|---|
Format: | Article |
Language: | English |
Published: |
Open Publishing Association
2013-03-01
|
Series: | Electronic Proceedings in Theoretical Computer Science |
Online Access: | http://arxiv.org/pdf/1303.7331v1 |
Similar Items
-
Ordered Models of the Lambda Calculus
by: Antonino Salibra, et al.
Published: (2013-12-01) -
The untyped stack calculus and Bohm's theorem
by: Alberto Carraro
Published: (2013-03-01) -
On Linear Information Systems
by: A. Bucciarelli, et al.
Published: (2010-03-01) -
Full Abstraction for the Resource Lambda Calculus with Tests, through Taylor Expansion
by: Thomas Ehrhard, et al.
Published: (2012-10-01) -
Minimal lambda-theories by ultraproducts
by: Antonio Bucciarelli, et al.
Published: (2013-03-01)