442 search results - page 75 / 89 » Proof Abstraction for Imperative Languages |
ICALP
2010
Springer
14 years 1 months ago
2010
Springer
Universal Coalgebra provides the notion of a coalgebra as the natural mathematical generalization of state-based evolving systems such as (infinite) words, trees, and transition s...
HASKELL
2007
ACM
14 years 14 days ago
2007
ACM
The use of typed intermediate languages can significantly increase the reliability of a compiler. By type-checking the code produced at each transformation stage, one can identify...
POPL
2010
ACM
14 years 6 months ago
2010
ACM
This paper introduces a new approach to type theory called pure subtype systems. Pure subtype systems differ from traditional approaches to type theory (such as pure type systems)...
POPL
2009
ACM
14 years 9 months ago
2009
ACM
We propose a new verification method for temporal properties of higher-order functional programs, which takes advantage of Ong's recent result on the decidability of the mode...
CIE
2009
Springer
14 years 3 months ago
2009
Springer
J. Raymundo Marcial–Romero and M. H. Escard´o described onal programming language with an abstract data type Real for the real numbers and a non-deterministic operator rtest: Re...