Pawns is a programming language under development that supports algebraic data types, polymorphism, higher order functions and “pure” declarative programming. It also supports impure imperative features including destructive update of shared data structures via pointers, allowing significantly increased efficiency for some operations. A novelty of Pawns is that all impure “effects” must be made obvious in the source code and they can be safely encapsulated in pure functions in a way that is checked by the compiler. Execution of a pure function can perform destructive updates on data structures that are local to or eventually returned from the function without risking modification of the data structures passed to the function. This paper des...
Sharing, an abstract domain developed by D. Jacobs and A. Langen for the analysis of logic programs,...
Coroutines and events are two common abstractions for writing concurrent programs. Because coroutine...
This paper explores how certain ideas in object oriented languages have their correspondents in func...
Pawns is a programming language under development that supports algebraic data types, polymorphism, ...
Abstract: We present a sharing analysis for the functional language Safe. This is a first-order eage...
Copyright © 2019 for this paper by its authors. We present a type and effect system for tracing and ...
Abstract. Automated verification of programs that utilize data structures with intrinsic sharing is ...
Types have been used to describe the size and shape of data structures at compile time. In polymorph...
This paper introduces an analysis technique, commutativity analysis, for automatically parallelizing...
We study the problem of an efficient and precise sharing analysis of (constraint) logic programs. Af...
Even though impressive progress has been made in the area of optimizing and parallelizing array-base...
It is argued that the concept of abstract datatypes can be extended in a way that allows for opera-t...
We introduce a type and effect system, for an imperative object calculus, which infers sharing possi...
We introduce a type and effect system, for an imperative object calculus, which infers sharing possi...
Precise modeling of the program heap is fundamental for under-standing the behavior of a program, an...
Sharing, an abstract domain developed by D. Jacobs and A. Langen for the analysis of logic programs,...
Coroutines and events are two common abstractions for writing concurrent programs. Because coroutine...
This paper explores how certain ideas in object oriented languages have their correspondents in func...
Pawns is a programming language under development that supports algebraic data types, polymorphism, ...
Abstract: We present a sharing analysis for the functional language Safe. This is a first-order eage...
Copyright © 2019 for this paper by its authors. We present a type and effect system for tracing and ...
Abstract. Automated verification of programs that utilize data structures with intrinsic sharing is ...
Types have been used to describe the size and shape of data structures at compile time. In polymorph...
This paper introduces an analysis technique, commutativity analysis, for automatically parallelizing...
We study the problem of an efficient and precise sharing analysis of (constraint) logic programs. Af...
Even though impressive progress has been made in the area of optimizing and parallelizing array-base...
It is argued that the concept of abstract datatypes can be extended in a way that allows for opera-t...
We introduce a type and effect system, for an imperative object calculus, which infers sharing possi...
We introduce a type and effect system, for an imperative object calculus, which infers sharing possi...
Precise modeling of the program heap is fundamental for under-standing the behavior of a program, an...
Sharing, an abstract domain developed by D. Jacobs and A. Langen for the analysis of logic programs,...
Coroutines and events are two common abstractions for writing concurrent programs. Because coroutine...
This paper explores how certain ideas in object oriented languages have their correspondents in func...