A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
Lecture Notes in Computer Science
The Cartesian closed categories have been shown by several authors to provide the right framework of the model theory of h-calculus. The second author developed this as a syntactic equivalence between two calculi, giving rise to a new kind of combinatory logic: the categorical combinatory logic, where computations can be done through simple rewrite rules, and, as usual with combinators, avoiding problems with variable name clashes. This paper goes further (though not requiring a previousdoi:10.1007/3-540-15975-4_29 fatcat:icnjiwex2bd6rckqejwo47jjbm