1226 search results - page 48 / 246 » Proofs, Programs and Abstract Complexity |
131
Voted
LPAR
2004
Springer
15 years 8 months ago
2004
Springer
Abstract. To produce a program guaranteed to satisfy a given specification one can synthesize it from a formal constructive proof that a computation satisfying that specification...
110
Voted
CAV
2009
Springer
15 years 6 months ago
2009
Springer
Designers often apply manual or semi-automatic loop and data transformations on array and loop intensive programs to improve performance. The transformations should preserve the fu...
153
Voted
ICFP
2010
ACM
15 years 3 months ago
2010
ACM
Modern proof assistants such as Coq and Isabelle provide high degrees of expressiveness and assurance because they support formal reasoning in higher-order logic and supply explic...
127
Voted
LICS
1994
IEEE
15 years 6 months ago
1994
IEEE
In this paper we study the interaction of subtyping and parametricity. We describe a logic for a programming language with parametric polymorphism and subtyping. The logic support...
122
Voted
ICALP
2010
Springer
15 years 7 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...