Sciweavers

159 search results - page 5 / 32
» Type Equivalence Checking in Persistent Object Systems
Sort
View
FOSSACS
2010
Springer
13 years 12 months ago
Untyped Recursion Schemes and Infinite Intersection Types
A new framework for higher-order program verification has been recently proposed, in which higher-order functional programs are modelled as higher-order recursion schemes and then ...
Takeshi Tsukada, Naoki Kobayashi
ECOOP
2007
Springer
14 years 2 months ago
Gradual Typing for Objects
Static and dynamic type systems have well-known strengths and weaknesses. In previous work we developed a gradual type system for a functional calculus named λ? →. Gradual typin...
Jeremy G. Siek, Walid Taha
POS
1994
Springer
14 years 22 days ago
Changing Persistent Applications
During the lifetime of an application, the objects and bindings in a persistent store may require modification in order to fix bugs or incorporate changes. Two mechanisms, Octopus...
Alex Farkas, Alan Dearle
ECOOP
2003
Springer
14 years 1 months ago
A Nominal Theory of Objects with Dependent Types
We design and study νObj, a calculus and dependent type system for objects and classes which can have types as members. Type can be aliases, abstract types, or new types. The type...
Martin Odersky, Vincent Cremet, Christine Röc...
POS
1998
Springer
14 years 26 days ago
Swizzle Barrier Optimizations for Orthogonal Persistence in Java
Swizzling refers to the translation of object references from an external, persistent format to an internal, transient format used during application execution. Eager swizzling sc...
Kumar Brahnmath, Nathaniel Nystrom, Antony L. Hosk...