We present a safe embedding of mutable data structures in functional languages. With safety we mean that confluence and (in some sense) referential transparency are maintained. We develop a static criterion based on abstract interpretation which checks that any side-effect which a function may exert via a destructive update remains invisible. The technique opens up the possibility of designing safe and efficient wide-spectrum languages which combine functional and imperative language constructs
Abstract. Pawns is a programming language under development that supports algebraic data types, poly...
Purely functional programming languages pride themselves with reifying effects that are implicit in ...
In their purest formulation, monads are used in functional programming for two purposes: (1) to hygi...
Abstract. Functional programs are more amenable to rigorous math-ematical analysis than imperative p...
The aggregate update problem has received considerable attention since pure functional program-ming ...
Restricting destructive update to values of a distinguished reference type prevents functions from b...
Abstract. Pure functional programming language offer many advan-tages over impure languages. Unfortu...
The aggregate update problem in functional languages is concerned with detecting cases where a funct...
AbstractWe investigate various equivalence relations between expressions in a first-order functional...
Program fragments in functional languages may be observationally congruent in a language without eff...
Safe is a first-order eager language with heap regions and unusual facilities such as programmer-con...
Pure functional programming language offer many advantages over impure languages. Unfortunately, the...
Abstract: We present a sharing analysis for the functional language Safe. This is a first-order eage...
We present a modal language for distributed computation which addresses the safety of mobile values ...
We present a destruction-aware type system for the functional lan-guage Safe, which is a first-order...
Abstract. Pawns is a programming language under development that supports algebraic data types, poly...
Purely functional programming languages pride themselves with reifying effects that are implicit in ...
In their purest formulation, monads are used in functional programming for two purposes: (1) to hygi...
Abstract. Functional programs are more amenable to rigorous math-ematical analysis than imperative p...
The aggregate update problem has received considerable attention since pure functional program-ming ...
Restricting destructive update to values of a distinguished reference type prevents functions from b...
Abstract. Pure functional programming language offer many advan-tages over impure languages. Unfortu...
The aggregate update problem in functional languages is concerned with detecting cases where a funct...
AbstractWe investigate various equivalence relations between expressions in a first-order functional...
Program fragments in functional languages may be observationally congruent in a language without eff...
Safe is a first-order eager language with heap regions and unusual facilities such as programmer-con...
Pure functional programming language offer many advantages over impure languages. Unfortunately, the...
Abstract: We present a sharing analysis for the functional language Safe. This is a first-order eage...
We present a modal language for distributed computation which addresses the safety of mobile values ...
We present a destruction-aware type system for the functional lan-guage Safe, which is a first-order...
Abstract. Pawns is a programming language under development that supports algebraic data types, poly...
Purely functional programming languages pride themselves with reifying effects that are implicit in ...
In their purest formulation, monads are used in functional programming for two purposes: (1) to hygi...