Technische Universit�t
Braunschweig
Institute f�r
Informatik
|
Zeit: |
26.06.02, 16.30 Uhr |
|
Ort: |
Informatikzentrum, M�hlenpfordtstra�e 23, H�rsaal M 160, 1. OG |
|
|
|
|
Vortragender: |
Federico De Marchi, University of
Leicester, Dept of Maths and Computer Science |
|
|
|
|
Thema: |
Categorical models for syntactic
structures |
|
|
|
|
|
|
Zusammenfassung:
|
Given a finitary signature, there is a variety of syntactic structures
which one can form over it. Finite and infinite terms are the most classical.
The former are used in initial algebra semantics, whereas the latter provide
a universe in which to interpret any other structure. People interested in
recursion have found fruitful to consider rational terms for their research,
as this forms the free iterative theory on the signature. Ongoing research is
now being developed on algebraic terms (recognisable by push-down automata),
and term graphs, which are essential in computation of functional programming
languages. Recent trends in research have developed a categorical approach to the
study of these structure. L. Moss, J. Adamek and his group, as well as ours,
used coalgebra to model infinite terms and some subsets of them. In our
recent work, we pointed out the main algebraic properties of these syntactic
structure and introduced the notion of coalgebraic monad in order to capture
them. The present talk aims to introduce the notion of coalgebraic monad and
provide some examples. We'll mention the simple cases of finite and infinite
terms, and of rational terms. More time will be devoted to the construction
of term graphs. Finally, we shall try and give an idea of the progress and
problems encountered in studying algebraic terms. |
Die Dozenten der Informatik