Many functional programs can be viewed as representation changers, that is, as functions that convert abstract values from one concrete representation to another. Examples of such programs include base-converters, binary adders and multipliers, and compilers. In this paper we give a number of different approaches to specifying representation changers (pointwise, functional, and relational), and present a simple technique that can be used to derive functional programs from the specifications
In the realm of functional programming a wealth of techniques have been explored to transform a prog...
We study the problem to transform functional programs, which intensively use append functions (like ...
Abstract Higher-order abstract syntax is a simple technique for implementing languages with function...
Many functional programs can be viewed as representation changers, that is, as functions that conver...
This article is an introduction to the use of relational calculi in deriving programs. Using the re...
The definition for the notion of a "function" is not cast in stone, but depends upon what we adopt a...
AbstractWe investigate various equivalence relations between expressions in a first-order functional...
While programming in a relational framework has much to offer over the functional style in terms of ...
We present a unified framework to describe and compare functional language implementations. We expre...
We express implementations of functional languages as a succession of program transformations in a c...
Program transformation concerns the derivation of an efficient program by applying correctness-pres...
AbstractRELFUN reciprocally extends Horn RELations and call-by-value FUNctions just enough to yield ...
The representation theorem for fork algebras was always misunderstood regarding its applications in ...
We examine the problem of finding fully abstract translations between programming languages, i.e., t...
AbstractWe elaborate our relational model of non-strict, imperative computations. The theory is exte...
In the realm of functional programming a wealth of techniques have been explored to transform a prog...
We study the problem to transform functional programs, which intensively use append functions (like ...
Abstract Higher-order abstract syntax is a simple technique for implementing languages with function...
Many functional programs can be viewed as representation changers, that is, as functions that conver...
This article is an introduction to the use of relational calculi in deriving programs. Using the re...
The definition for the notion of a "function" is not cast in stone, but depends upon what we adopt a...
AbstractWe investigate various equivalence relations between expressions in a first-order functional...
While programming in a relational framework has much to offer over the functional style in terms of ...
We present a unified framework to describe and compare functional language implementations. We expre...
We express implementations of functional languages as a succession of program transformations in a c...
Program transformation concerns the derivation of an efficient program by applying correctness-pres...
AbstractRELFUN reciprocally extends Horn RELations and call-by-value FUNctions just enough to yield ...
The representation theorem for fork algebras was always misunderstood regarding its applications in ...
We examine the problem of finding fully abstract translations between programming languages, i.e., t...
AbstractWe elaborate our relational model of non-strict, imperative computations. The theory is exte...
In the realm of functional programming a wealth of techniques have been explored to transform a prog...
We study the problem to transform functional programs, which intensively use append functions (like ...
Abstract Higher-order abstract syntax is a simple technique for implementing languages with function...