1321 search results - page 32 / 265 » Subtyping in Logical Form |
122
click to vote
ICDE
1992
IEEE
15 years 3 months ago
1992
IEEE
Contrary to popular belief, relation schemes in good classical normal forms are not necessarily devoid of redundancies. This arises from the fact that classical data dependencies ...
OOPSLA
2009
Springer
15 years 6 months ago
2009
Springer
Multiple inheritance has long been plagued with the “diamond” inheritance problem, leading to solutions that restrict expressiveness, such as mixins and traits. Instead, we ad...
TPHOL
2005
IEEE
15 years 5 months ago
2005
IEEE
Abstract. How close are we to a world where every paper on programming languages is accompanied by an electronic appendix with machinechecked proofs? We propose an initial set of b...
104
click to vote
DAGSTUHL
1996
15 years 1 months ago
1996
Abstract. Type-directed partial evaluation stems from the residualization of arbitrary static values in dynamic contexts, given their type. Its algorithm coincides with the one for...
ATAL
2005
Springer
15 years 5 months ago
2005
Springer
We sketch how to express typical features of agent communication protocols in a simple temporal logic and show that conformance verification at runtime reduces to a generalised f...