; Lab. for Found. of Comp. Sci.; University of Edinburgh; On leave from Univ. di Pisa
SVM HeaderParse 0.2
; EH9 3JZ Edinburgh, UK
SVM HeaderParse 0.1
The lambda-calculus is considered an useful mathematical tool in the study of programming languages. However, if one uses beta-eta-conversion to prove equivalence of programs, then a gross simplification is introduced. We give a calculus based on a categorical semantics for computations, which provides a correct basis for proving equivalence of programs, independent from any specific computational model.