d Abstract) Alexander Aiken1 and Edward L. Wimmers2 and Jens Palsberg3 1 EECS Department, University of California at Berkeley, Berkeley, CA 94720-1776. 2 IBM Almaden Research Cent...
Dynamic typing is a program analysis targeted at removing runtime tagging and untagging operations from programs written in dynamically typed languages. This paper compares dynami...
Abstract. Models addressing both structure and behaviour of a system are usually quite complex. Much of the complexity is caused by the necessity to distinguish between different c...
We present new sound and complete axiomatizations of type equality and subtype inequality for a first-order type language with regular recursive types. The rules are motivated by ...
This paper is concerned with design, implementation and verification of persistent purely functional data structures which are motivated by the representation of natural numbers us...