AbstractPast work on the semantics of vectors and arrays provides a denotational semantics for the new, higher-order, polymorphic array programming language FISh, that uses static analysis to determine array shapes. This semantics will be combined with that of shape polymorphism to underpin a language that will support both shape analysis and shape polymorphism on both arrays and inductive types
Shape analysis deals with the synthesis of invariants for programs manipulating heap-allocated data...
Abstract: Shape grammars are, in general, intractable. Even amongst tractable shape grammars, their ...
Abstract. This paper deals with the problem of statically inferring the shape of an array in languag...
email cbjsocsutseduau FISh is an arraybased programming language that com bines imperative and func...
AbstractShapely types separate data, represented by lists, from shape, or structure. This separation...
Abstract. Besides element type and values, a multidimensional array is characterized by the number o...
We introduce S2, a typed intermediate language for vectors, based on a 2-level type-theory, which di...
Shape theory provides a framework for the study of data types in which shape and data can be manipul...
Denotational semantics is a powerful technique to formally define programming languages. However, la...
The aim of static analysis is to infer invariants about programs that are precise enough to establis...
Shape grammars are a generative formalism in which dynamic changes to shape structure plays a vital ...
One of the main hurdles that array-based languages such as MATLAB and APL pose to compilation is the...
Most of the existing high-level array processing languages support a fixed set of pre-defined array ...
This podcast examines the concept of polymorphism and demonstrates how polymorphism works in C#, Jav...
International audienceThe computation of semantic information about the behavior of pointer-manipula...
Shape analysis deals with the synthesis of invariants for programs manipulating heap-allocated data...
Abstract: Shape grammars are, in general, intractable. Even amongst tractable shape grammars, their ...
Abstract. This paper deals with the problem of statically inferring the shape of an array in languag...
email cbjsocsutseduau FISh is an arraybased programming language that com bines imperative and func...
AbstractShapely types separate data, represented by lists, from shape, or structure. This separation...
Abstract. Besides element type and values, a multidimensional array is characterized by the number o...
We introduce S2, a typed intermediate language for vectors, based on a 2-level type-theory, which di...
Shape theory provides a framework for the study of data types in which shape and data can be manipul...
Denotational semantics is a powerful technique to formally define programming languages. However, la...
The aim of static analysis is to infer invariants about programs that are precise enough to establis...
Shape grammars are a generative formalism in which dynamic changes to shape structure plays a vital ...
One of the main hurdles that array-based languages such as MATLAB and APL pose to compilation is the...
Most of the existing high-level array processing languages support a fixed set of pre-defined array ...
This podcast examines the concept of polymorphism and demonstrates how polymorphism works in C#, Jav...
International audienceThe computation of semantic information about the behavior of pointer-manipula...
Shape analysis deals with the synthesis of invariants for programs manipulating heap-allocated data...
Abstract: Shape grammars are, in general, intractable. Even amongst tractable shape grammars, their ...
Abstract. This paper deals with the problem of statically inferring the shape of an array in languag...
DOI
Add to ORKG