Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
436508 | Theoretical Computer Science | 2006 | 19 Pages |
Abstract
A Boolean category is a restriction category if and only if it has one exception and all morphisms are deterministic. In the category of sets, taut monads are precisely the Boolean ones. It follows that collection monad types in Haskell inherit an assertion calculus based on dynamic logic.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics