Abstract
We introduce an algebraic framework for the equational specification of algebras of types and combinators. A categorical semantics for type specifications is given based on cofibrations of categories of algebras. It is shown that each equational type specification admits an initial model semantics, and we present complete inference systems for type assignments and equations.
Cite
CITATION STYLE
Meinke, K. (1992). Equational specification of abstract types and combinators. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 626 LNCS, pp. 257–271). Springer Verlag. https://doi.org/10.1007/bfb0023772
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
