Talk "Many-Sorted (Co)Algebraic Specification with Base Sets"

by Peter Padawitz

Tue, 07 January 2014 at 04:30 pm in Theddingworth near Leicester, UK

Abstract: We present some fundamentals of a uniform approach to specify, implement and reason about (co)algebraic models in a many-sorted setting that covers constant, polynomial and collection types. Emphasis is first put on initial term and final coterm or continuous-tree models and then on syntactic criteria for the unique solvability of recursive or iterative equations in those models. The setting allows us, for instance, to extend Brzozowski's acceptors of regular languages to acceptors of context-free languages, given by non-left-recursive grammars.