Sciweavers

159 search results - page 1 / 32
» Type Equivalence Checking in Persistent Object Systems
Sort
View
POS
1990
Springer
13 years 9 months ago
Type Equivalence Checking in Persistent Object Systems
Richard C. H. Connor, Alfred L. Brown, Quintin I. ...
POS
1994
Springer
13 years 9 months ago
Expressing Object Residency Optimizations Using Pointer Type Annotations
We consider some issues in optimizing persistent programming languages. In particular, we show how to express optimizations of object residency checks in strongly typed persistent...
J. Eliot B. Moss, Antony L. Hosking
WFLP
2009
Springer
244views Algorithms» more  WFLP 2009»
13 years 11 months ago
Type Checking and Inference Are Equivalent in Lambda Calculi with Existential Types
This paper shows that type-checking and type-inference problems are equivalent in domain-free lambda calculi with existential types, that is, type-checking problem is Turing reduci...
Yuki Kato, Koji Nakazawa
ESOP
2005
Springer
13 years 10 months ago
A Type System Equivalent to a Model Checker
ite-state abstraction scheme such as predicate abstraction. The type system, which is also parametric, type checks exactly those programs that are accepted by the model checker. It...
Mayur Naik, Jens Palsberg
ICDE
1997
IEEE
121views Database» more  ICDE 1997»
14 years 6 months ago
A Persistent Hyper-Programming System
We demonstrate the use of a hyper-programming system in building persistent applications. This allows program representations to contain type-safe links to persistent objects embe...
Graham N. C. Kirby, Ronald Morrison, David S. Munr...