4211 search results - page 274 / 843 » Types as Abstract Interpretations |
197
click to vote
POPL
2010
ACM
15 years 6 months ago
2010
ACM
In this paper, we explore the potential of the theory of nested words for partial correctness proofs of recursive programs. Our conceptual contribution is a simple framework that ...
305
click to vote
POPL
2004
ACM
16 years 7 months ago
2004
ACM
We present a framework for the certification of compilation and of compiled programs. Our approach uses a symbolic transfer functions-based representation of programs, so as to ch...
200
click to vote
ICFP
2005
ACM
16 years 6 months ago
2005
ACM
We present a foundation for a computational meta-theory of languages with bindings implemented in a computer-aided formal reasoning environment. Our theory provides the ability to...
214
click to vote
POPL
2012
ACM
14 years 2 months ago
2012
ACM
We show how to combine a general purpose type system for an existing language with support for programming with binders and contexts by refining the type system of ML with a rest...
168
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
String diagrams are a powerful tool for reasoning about physical processes, logic circuits, tensor networks, and many other compositional structures. The distinguishing feature of...