1626 search results - page 52 / 326 » Subtyping with Power Types |
104
Voted
DAGSTUHL
1993
15 years 4 months ago
1993
In this paper we present a type system for graph rewrite systems: uniqueness typing. It employs usage information to deduce whether an object is `unique' at a certain moment,...
124
Voted
LICS
2008
IEEE
15 years 9 months ago
2008
IEEE
This paper presents a new bisimulation theory for parametric polymorphism which enables straightforward coinductive proofs of program equivalences involving existential types. The...
108
Voted
PODS
1999
ACM
15 years 7 months ago
1999
ACM
We give a polymorphic account of the relational algebra. We introduce a formalism of \type formulas" speci cally tuned for relational algebra expressions, and present an algo...
91
Voted
ENTCS
2008
15 years 2 months ago
2008
We report our experience with exploring a new point in the design space for formal reasoning systems: the development of the programming language mega. mega is intended as both a ...
123
Voted
LOBJET
2000
15 years 2 months ago
2000
ABSTRACT. As informal methods do little to help their use for concurrent and distributed programming, one of the most challenging current tasks is to build tools based on formal me...