3658 search results - page 571 / 732 » The logic of proofs, semantically |
183
click to vote
POPL
2012
ACM
14 years 2 months ago
2012
ACM
We present a general theory of Gifford-style type and effect annotations, where effect annotations are sets of effects. Generality is achieved by recourse to the theory of algebra...
175
click to vote
ESOP
2004
Springer
15 years 12 months ago
2004
Springer
t) Peter W. O’Hearn Queen Mary, University of London In the 1960s Dijkstra suggested that, in order to limit the complexity of potential process interactions, concurrent programs...
168
click to vote
CC
2010
Springer
16 years 1 months ago
2010
Springer
The problem of locally transforming or translating programs without altering their semantics is central to the construction of correct compilers. For concurrent shared-memory progr...
156
click to vote
CIE
2009
Springer
16 years 1 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...
189
click to vote
RTA
2007
Springer
16 years 18 days ago
2007
Springer
This paper shows how to construct static analyzers using tree automata and rewriting techniques. Starting from a term rewriting system representing the operational semantics of the...