Add to ORKGA good way of developing a correct program is to calculate it from its specification. Functional programming languages are especially suitable for this, because their referential transparency greatly helps calculation. We discuss the ideas behind program calculation, and illustrate with an example (the maximum segment sum problem). We show that calculations are driven by promotion, and that promotion properties arise from universal properties of the data types involved
In this note we present a method for the calculational derivation of logic programs, employing techn...
We identify a class of PROLOG programs that can be used as the specification of the functional progr...
This document gives a quick tutorial introduction to a functional program verification. In the f...
Functional programs are merely equations; they may be manipulated by straightforward equational reas...
In this chapter we examine ways in which functional programs can be proved correct. For a number of ...
The significance of functional programming is revealed as that the feasible approach to language ext...
The functional programming style describes computations concisely. The applicative nature of functio...
The driving idea of functional programming is to make programming more closely related to mathematic...
Functional programming is a programming paradigm like object-oriented programming and logic programm...
The significance of functional programming is revealed as that the feasible approach to language ext...
Our goal is to develop a new and highly flexible approach to program optimization. Instead of apply...
Today, the imperative style of programming is the most common, but at the same time is not inviolabl...
ing out and studying those patterns of computation as useful objects in their own right leads to fur...
We present techniques that enable higher-order functional computations to “explain” their work by an...
Functional logic languages amalgamate functional and logic \u000Aprogramming programming paradigms. ...
In this note we present a method for the calculational derivation of logic programs, employing techn...
We identify a class of PROLOG programs that can be used as the specification of the functional progr...
This document gives a quick tutorial introduction to a functional program verification. In the f...
Functional programs are merely equations; they may be manipulated by straightforward equational reas...
In this chapter we examine ways in which functional programs can be proved correct. For a number of ...
The significance of functional programming is revealed as that the feasible approach to language ext...
The functional programming style describes computations concisely. The applicative nature of functio...
The driving idea of functional programming is to make programming more closely related to mathematic...
Functional programming is a programming paradigm like object-oriented programming and logic programm...
The significance of functional programming is revealed as that the feasible approach to language ext...
Our goal is to develop a new and highly flexible approach to program optimization. Instead of apply...
Today, the imperative style of programming is the most common, but at the same time is not inviolabl...
ing out and studying those patterns of computation as useful objects in their own right leads to fur...
We present techniques that enable higher-order functional computations to “explain” their work by an...
Functional logic languages amalgamate functional and logic \u000Aprogramming programming paradigms. ...
In this note we present a method for the calculational derivation of logic programs, employing techn...
We identify a class of PROLOG programs that can be used as the specification of the functional progr...
This document gives a quick tutorial introduction to a functional program verification. In the f...