Open AccessType Algebras, Functor Categories, and Block Structure
Author(s) -
Frank J. Oles
Publication year - 1983
Publication title -
daimi pb
Language(s) - English
Resource type - Journals
eISSN - 2245-9316
pISSN - 0105-8517
DOI - 10.7146/dpb.v12i156.7430
Subject(s) - functor , partially ordered set , mathematics , block (permutation group theory) , type (biology) , stack (abstract data type) , phrase , semantics (computer science) , algebra over a field , pure mathematics , computer science , discrete mathematics , combinatorics , programming language , natural language processing , ecology , biology
In this paper we outline a category-theoretic approach to the semantics of ALGOL-like languages in which particular attention is paid to the use of functor categories as a mechanism to reflect stack discipline. Also, we explore the idea that implicit conversions can be modelled by making the phrase types of a language into a poset, and we show how any poset freely generates a type algebra.