63 search results - page 11 / 13 » On Completeness of Logical Relations for Monadic Types |
LOGCOM
2010
13 years 4 months ago
2010
A theory of infinitary deduction systems is developed for the modal logic of coalgebras for measurable polynomial functors on the category of measurable spaces. These functors ha...
LICS
2006
IEEE
14 years 2 days ago
2006
IEEE
We prove that the modal mu-calculus model-checking problem for (ranked and ordered) node-labelled trees that are generated by order-n recursion schemes (whether safe or not, and w...
LOGCOM
2008
13 years 6 months ago
2008
Fibring is a metalogical constructor that permits to combine different logics by operating on their deductive systems under certain natural restrictions, as for example that the t...
ENTCS
2007
13 years 6 months ago
2007
We introduce the idea of optimisation validation, which is to formally establish that an instance of an optimising transformation indeed improves with respect to some resource mea...
CADE
2003
Springer
14 years 6 months ago
2003
Springer
Foundational certified code systems seek to prove untrusted programs to be safe relative to safety policies given in terms of actual machine architectures, thereby improving the s...