AbstractShapely types separate data, represented by lists, from shape, or structure. This separation supports shape polymorphism, where operations are defined for arbitrary shapes, and shapely operations, for which the shape of the result is determined by that of the input, permitting static shape checking. The shapely types are closed under the formation of fixpoints, and hence include the usual algebraic types of lists, trees, etc. They also include other standard data structures such as arrays, graphs and records
Shape analysis deals with the synthesis of invariants for programs manipulating heap-allocated data ...
The polymorphic type system of ML can be extended in two ways to make it the appropriate basis of a ...
Types have been used to describe the size and shape of data structures at compile time. In polymorph...
AbstractPast work on the semantics of vectors and arrays provides a denotational semantics for the n...
Understanding, discovering, and proving useful properties of sophisticated data structures are centr...
Shape Analysis is concerned with determining "shape invariants", i.e. structural properties of the h...
Shape theory provides a framework for the study of data types in which shape and data can be manipul...
This paper describes structural polymorphism, a new form of type polymorphism appropriate to functio...
Verification of programs requires reasoning about sets of program states. In case of programs manip...
AbstractThis paper demonstrates the potential for combining the polytypic and monadic programming st...
The basic idea behind this task is to find out how languages encode basic shape distinctions such as...
Abstract. Heap entities tend to contain complex references to each other. To manage this complexity,...
Shape analysis is a static analysis of the source code of a program to determine shapes and manipula...
The polymorphic type system of ML can be extended in two ways that make it appropriate as the basis ...
Abstract. Real-world data structures are often enhanced with addi-tional pointers capturing alternat...
Shape analysis deals with the synthesis of invariants for programs manipulating heap-allocated data ...
The polymorphic type system of ML can be extended in two ways to make it the appropriate basis of a ...
Types have been used to describe the size and shape of data structures at compile time. In polymorph...
AbstractPast work on the semantics of vectors and arrays provides a denotational semantics for the n...
Understanding, discovering, and proving useful properties of sophisticated data structures are centr...
Shape Analysis is concerned with determining "shape invariants", i.e. structural properties of the h...
Shape theory provides a framework for the study of data types in which shape and data can be manipul...
This paper describes structural polymorphism, a new form of type polymorphism appropriate to functio...
Verification of programs requires reasoning about sets of program states. In case of programs manip...
AbstractThis paper demonstrates the potential for combining the polytypic and monadic programming st...
The basic idea behind this task is to find out how languages encode basic shape distinctions such as...
Abstract. Heap entities tend to contain complex references to each other. To manage this complexity,...
Shape analysis is a static analysis of the source code of a program to determine shapes and manipula...
The polymorphic type system of ML can be extended in two ways that make it appropriate as the basis ...
Abstract. Real-world data structures are often enhanced with addi-tional pointers capturing alternat...
Shape analysis deals with the synthesis of invariants for programs manipulating heap-allocated data ...
The polymorphic type system of ML can be extended in two ways to make it the appropriate basis of a ...
Types have been used to describe the size and shape of data structures at compile time. In polymorph...