Abstract: The lambda -calculus is considered a 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. The author gives 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.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
Publication Year: 2003
Publication Date: 2003-01-07
Language: en
Type: article
Indexed In: ['crossref']
Access and Citation
Cited By Count: 832
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot