| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 423429 | Electronic Notes in Theoretical Computer Science | 2008 | 26 Pages |
Abstract
We compare Moss' language and languages with predicate liftings. We prove that every monadic predicate lifting for a Kripke polynomial functor can be translated into Moss' language. We also prove that Moss' modality can always be translated into an appropriate language with predicate liftings.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
