2540 search results - page 324 / 508 » Abstract Logics as Dialgebras |
OOPSLA
2005
Springer
14 years 4 months ago
2005
Springer
This paper describes a type system that is capable of expressing and enforcing immutability constraints. The speonstraint expressed is that the abstract state of the object to whi...
OOPSLA
2004
Springer
14 years 4 months ago
2004
Springer
This paper describes a type system that is capable of expressing and enforcing immutability constraints. The specific constraint exis that the abstract state of the object to whi...
CORR
2004
Springer
13 years 10 months ago
2004
Springer
It is well-known that freeness and linearity information positively interact with aliasing information, allowing both the precision and the efficiency of the sharing analysis of l...
POPL
2010
ACM
13 years 11 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 ...
ICFP
2010
ACM
13 years 12 months ago
2010
ACM
Reasoning about program equivalence is one of the oldest problems in semantics. In recent years, useful techniques have been developed, based on bisimulations and logical relation...