Equational Specification of Abstract Types and Combinators

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.

[1]  Michael Barr,et al.  Category theory for computing science , 1995, Prentice Hall International Series in Computer Science.

[2]  J. Van Leeuwen,et al.  Handbook of theoretical computer science - Part A: Algorithms and complexity; Part B: Formal models and semantics , 1990 .

[3]  J. Girard,et al.  Proofs and types , 1989 .

[4]  J. Roger Hindley,et al.  Introduction to combinators and λ-calculus , 1986, Acta Applicandae Mathematicae.

[5]  John C. Mitchell,et al.  Type Systems for Programming Languages , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[6]  Axel Poigné,et al.  On Specifications, Theories, and Models with Higher Types , 1986, Inf. Control..

[7]  Karl Meinke.  Universal Algebra in Higher Types , 1990, ADT.

[8]  John C. Reynolds,et al.  Algebraic Methods in Semantics , 1985 .