scientific article; zbMATH DE number 4028891
[For the entire collection see Zbl 0598.00017.] A design for a programming language based on a calculus of type subsumption is presented. A close analysis of the notion of term in universal algebra and logic shows how the concept of subsumption may be extended to bear more semantic power. A mathematical semantics is proposed for a particular language where type structures are first-class objects, which can be practically implemented. In this language, computation amounts to type checking. Possible connections of this model of computation with logic are discussed. Finally, further extensions of the language are described which can be given well-defined semantics without loss of the basic language philosophy.
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 Q3769958)