We introduce S2, a typed intermediate language for vectors, based on a 2-level type-theory, which distinguishes between compile-time and run-time. The paper shows how S2 can be used to extract useful information from programs written in the Nested Sequence Calculus N SC, an idealized high-level parallel calculus for nested sequences. We study two translations from N SC to S2. The most interesting shows that shape analysis (in the sense of Jay) can be handled at compile-time
There is a significant class of operations such as mapping that are common to all data structures. T...
The writer defines graphics-oriented data types and operators as the basis for a graphics-oriented p...
The Shape Calculus is a bio-inspired calculus for describing 3D shapes moving in a space. A shape fo...
Abstract. Languages for intensional type analysis permit ad-hoc polymorphism, or run-time analysis o...
AbstractBased on a discrete curvature (DC) notation [1], we propose an approach for mapping 2D shape...
The aim of static analysis is to infer invariants about programs that are precise enough to establis...
AbstractPast work on the semantics of vectors and arrays provides a denotational semantics for the n...
Standard topological devices can be adapted for shapes, and then used to establish the continuity of...
We present λ CIL, a typed λ-calculus which serves as the foundation for a typed intermediate languag...
Set-Based Analysis is an efficient and accurate program analysis for higher-order languages. It expl...
Many different mobile process calculi have been invented, and for each some number of type systems ...
Shape analysis concerns the problem of determining \shape invariants" for programs that perform...
Over the years, mathematical models have become increasingly complex. Rarely can we accurately model...
This thesis develops telescoping-language technology for automatically generating high performance l...
The development of the C++ programming language and its standard library has undergone a renaissance...
There is a significant class of operations such as mapping that are common to all data structures. T...
The writer defines graphics-oriented data types and operators as the basis for a graphics-oriented p...
The Shape Calculus is a bio-inspired calculus for describing 3D shapes moving in a space. A shape fo...
Abstract. Languages for intensional type analysis permit ad-hoc polymorphism, or run-time analysis o...
AbstractBased on a discrete curvature (DC) notation [1], we propose an approach for mapping 2D shape...
The aim of static analysis is to infer invariants about programs that are precise enough to establis...
AbstractPast work on the semantics of vectors and arrays provides a denotational semantics for the n...
Standard topological devices can be adapted for shapes, and then used to establish the continuity of...
We present λ CIL, a typed λ-calculus which serves as the foundation for a typed intermediate languag...
Set-Based Analysis is an efficient and accurate program analysis for higher-order languages. It expl...
Many different mobile process calculi have been invented, and for each some number of type systems ...
Shape analysis concerns the problem of determining \shape invariants" for programs that perform...
Over the years, mathematical models have become increasingly complex. Rarely can we accurately model...
This thesis develops telescoping-language technology for automatically generating high performance l...
The development of the C++ programming language and its standard library has undergone a renaissance...
There is a significant class of operations such as mapping that are common to all data structures. T...
The writer defines graphics-oriented data types and operators as the basis for a graphics-oriented p...
The Shape Calculus is a bio-inspired calculus for describing 3D shapes moving in a space. A shape fo...