P.-L. Curien & H. Herbelin (2000):
The duality of computation.
In: Proceedings of the Fifth ACM SIGPLAN International Conference on Functional Programming (ICFP '00), Montreal, Canada, September 18-21, 2000,
SIGPLAN Notices 35(9).
ACM,
pp. 233–243,
doi:10.1145/351240.351262.
D. Prawitz (1965):
Natural Deduction. A Proof-Theoretical Study.
Almquist and Wiksell, Stockholm.
N. Rehof & M. Sorensen (1994):
The λ_Δ-calculus.
In: TACS'94,
Lecture Notes in Computer Science 789.
Springer Verlag,
pp. 516–542,
doi:10.1007/3-540-57887-0_113.
G. Stalmarck (1991):
Normalization theorems for full first order classical natural deduction.
The Journal of Symbolic Logic 56(1),
pp. 129–149,
doi:10.2307/2274910.
R. Statman (1974):
Structural complexity of proofs.
Stanford University.
eptcs@eptcs.org