scientific article; zbMATH DE number 3928997
[For the entire collection see Zbl 0568.00019.] Following the idea behind algebraic theories we define a fairly general notion of equivalence between two many-sorted equational presentations s.t. an equivalence is induced on the corresponding categories of models. This definition allows to bring down to a symbolic level some equivalences known to model theorists. We illustrate this for the known connection between \(\lambda\)-calculus and cartesian closed categories. We present a syntactic equivalence between an untyped version of cartesian closed categories (i.e. where objects are dropped), and cartesian closed categories with a universal object, isomorphic to its product and function spaces, thus relating at a purely syntactic level an untyped calculus and a typed calculus. Direct syntactic equivalences between \(\lambda\)-calculus and cartesian closed categories are explored in companion papers: the direction from cartesian closed categories may be used for an elegant solution of the word problem of cartesian closed categories, whereas the direction to cartesian closed categories offers simple and efficient techniques for implementing functional programming languages, well suited for special VLSI design.
- On the semantic equivalence of language syntax formalisms
- Scott sentences for equivalence structures
- The HASCASL prologue: Categorical syntax and semantics of the partial \(\lambda\)-calculus
- Applications of methods of proof theory in category theory.
- scientific article; zbMATH DE number 65742 (Why is no real title available?)
- A SYNTACTIC CHARACTERIZATION OF MORITA EQUIVALENCE
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3703897)