Computer Science – Logic in Computer Science
Scientific paper
2010-06-15
Computer Science
Logic in Computer Science
16 pages
Scientific paper
We investigate the foundations of a theory of algebraic data types with variable binding inside classical universal algebra. In the first part, a category-theoretic study of monads over the nominal sets of Gabbay and Pitts leads us to introduce new notions of finitary based monads and uniform monads. In a second part we spell out these notions in the language of universal algebra, show how to recover the logics of Gabbay-Mathijssen and Clouston-Pitts, and apply classical results from universal algebra.
Kurz Alexander
Petrişan Daniela
Velebil Jiří
No associations
LandOfFree
Algebraic Theories over Nominal Sets does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Algebraic Theories over Nominal Sets, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Algebraic Theories over Nominal Sets will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-105322