We present a typed polymorphic calculus that supports a general mechanism for view definition and object sharing among classes. In this calculus, a class can contain inclusion specifications of objects from other classes. Each such specification consists of a predicate determining the subset of objects to be included and a viewing function under which those included objects are manipulated. Both predicates and viewing functions can be any type consistent programs definable in the polymorphic calculus. Inclusion specifications among classes can be cyclic, allowing mutually recursive class definitions. These features achieve flexible view definitions and wide range of class organizations in a compact and elegant way. Moreover, the calculus pr...
AbstractFlexibility of programming and efficiency of program execution are two important features of...
We present a method for providing semantic interpretations for languages with a type system featurin...
AbstractWe present an imperative calculus for a class-based language. By introducing classes as the ...
Our objective is to understand the notion of type in programming languages, present a model of typed...
Our objective is to understand the notion of type in programming languages, present a model of typed...
The polymorphic type system of ML can be extended in two ways that make it appropriate as the basis ...
We describe an object calculus with selftype and binary methods. The main feature of this calculus i...
We consider the problem of representing heterogeneous collections of objects in a typed polymorphic ...
The polymorphic type system of ML can be extended in two ways to make it the appropriate basis of a ...
The polymorphic type system of ML can be extended in two ways that make it appropriate as the basis ...
AbstractA number of data models for complex database objects have been proposed. Unfortunately, thes...
This thesis develops a polymorphic type system for logic programs. Our approach is semantically orie...
We present a type inference algoritm and its verification for an object-oriented programming languag...
We present a formulation of the polyadic π-calculus featuring a syntactic category for agents, toget...
Types have been used to describe the size and shape of data structures at compile time. In polymorph...
AbstractFlexibility of programming and efficiency of program execution are two important features of...
We present a method for providing semantic interpretations for languages with a type system featurin...
AbstractWe present an imperative calculus for a class-based language. By introducing classes as the ...
Our objective is to understand the notion of type in programming languages, present a model of typed...
Our objective is to understand the notion of type in programming languages, present a model of typed...
The polymorphic type system of ML can be extended in two ways that make it appropriate as the basis ...
We describe an object calculus with selftype and binary methods. The main feature of this calculus i...
We consider the problem of representing heterogeneous collections of objects in a typed polymorphic ...
The polymorphic type system of ML can be extended in two ways to make it the appropriate basis of a ...
The polymorphic type system of ML can be extended in two ways that make it appropriate as the basis ...
AbstractA number of data models for complex database objects have been proposed. Unfortunately, thes...
This thesis develops a polymorphic type system for logic programs. Our approach is semantically orie...
We present a type inference algoritm and its verification for an object-oriented programming languag...
We present a formulation of the polyadic π-calculus featuring a syntactic category for agents, toget...
Types have been used to describe the size and shape of data structures at compile time. In polymorph...
AbstractFlexibility of programming and efficiency of program execution are two important features of...
We present a method for providing semantic interpretations for languages with a type system featurin...
AbstractWe present an imperative calculus for a class-based language. By introducing classes as the ...