Category theory for computing science
Category theory for computing science
Notions of computation and monads
Information and Computation
Monads and algebras in the semantics of partial data types
Theoretical Computer Science
Partial map classifiers and partial cartesian closed categories
MFPS '92 Selected papers of the meeting on Mathematical foundations of programming semantics. Part II : lambda calculus and domain theory: lambda calculus and domain theory
Lifting Theorems for Kleisli Categories
Proceedings of the 9th International Conference on Mathematical Foundations of Programming Semantics
Categories of Timed Stochastic Relations
Electronic Notes in Theoretical Computer Science (ENTCS)
| Hi-index | 5.23 |
In this paper, we present results that provide an abstract setting for the construction and interpretation of categories of algebras appearing in various semantic examples including those related to Scott domains and cartesian closed categories. A methodology is introduced that lifts adjoint pairs on categories with monads to categories whose objects are algebras for these monads. Results are achieved by exploiting prior work on Kleisli liftings and the existence of key isomorphisms. While applicable to domain theory and the semantics of partiality, the construction at work is considerably more general and is applicable to other settings as well.