State transformers and modes of computation

State transformers, which form the objects in a subequalizing category, are a generalization of the transition functions of automata. The 2-categorical properties of subequalizers are developed and related to adjunctions in a 2-category. A calculus of monads in a 2-category is presented, and general lifting theorems are proved. Applications to constructions in categorical automata theory are given, and a representation theorem for strong monads into the monad of continuations is proved.

Name thesis:degree_name

Ph.D.

Level thesis:degree_level

Dissertation

Discipline thesis:degree_discipline

Mathematics

Grantor

University of Illinois at Urbana-Champaign

Year dc:date

2011

Author dc:creator

• Carpenter, Bruce Franklin

Contributors dc:contributor

• Gray, John

• Mathematics
• Computer Science

Statement dc:rights

• Copyright 1995 Carpenter, Bruce Franklin

Language dc:language

eng

Identifier

AAI9522087
(UMI)AAI9522087

OAI identifier oai:identifier

oai:www.ideals.illinois.edu:2142/22388