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 ...
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...
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...
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...
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...