Functional programs are merely equations; they may be manipulated by straightforward equational reasoning. In particular, one can use this style of reasoning to calculate programs, in the same way that one calculates numeric values in arithmetic. Many useful theorems for such reasoning derive from an algebraic view of programs, built around datatypes and their operations. Traditional algebraic methods concentrate on initial algebras, constructors, and values; dual co-algebraic methods concentrate on final co-algebras, destructors, and processes. Both methods are elegant and powerful; they deserve to be combined
In this chapter we examine ways in which functional programs can be proved correct. For a number of ...
In this paper we solve musical equational programs by means of higher order functions. The initial s...
We propose a new approach to the computer-assisted verification of functional programs. We work in f...
Functional programming is particularly well suited for equational reasoning – referential trans-pare...
A good way of developing a correct program is to calculate it from its specification. Functional pro...
We consider the following problem in proving equations in models of functional languages: given a ca...
One of the appeals of pure functional programming is that it is so amenable to equational reasoning....
One of the appeals of pure functional programming is that it is so amenable to equational reasoning....
Functional programs are particularly well suited to formal manipulation by equational reasoning. In ...
Equality plays an important role in our life, and we practise equational reasoning everyday. We can ...
In this note we present a method for the calculational derivation of logic programs, employing techn...
Functional Programming (FP) systems are modified and extended to form Nondeterministic Functional Pr...
In this note we present a method for the calculational derivation of logic programs, employing techn...
An equational approach to the synthesis of functional and logic program is taken. Typically, the syn...
An \em equational system\/ is a set of equations. Often we are interested in knowing if an equation ...
In this chapter we examine ways in which functional programs can be proved correct. For a number of ...
In this paper we solve musical equational programs by means of higher order functions. The initial s...
We propose a new approach to the computer-assisted verification of functional programs. We work in f...
Functional programming is particularly well suited for equational reasoning – referential trans-pare...
A good way of developing a correct program is to calculate it from its specification. Functional pro...
We consider the following problem in proving equations in models of functional languages: given a ca...
One of the appeals of pure functional programming is that it is so amenable to equational reasoning....
One of the appeals of pure functional programming is that it is so amenable to equational reasoning....
Functional programs are particularly well suited to formal manipulation by equational reasoning. In ...
Equality plays an important role in our life, and we practise equational reasoning everyday. We can ...
In this note we present a method for the calculational derivation of logic programs, employing techn...
Functional Programming (FP) systems are modified and extended to form Nondeterministic Functional Pr...
In this note we present a method for the calculational derivation of logic programs, employing techn...
An equational approach to the synthesis of functional and logic program is taken. Typically, the syn...
An \em equational system\/ is a set of equations. Often we are interested in knowing if an equation ...
In this chapter we examine ways in which functional programs can be proved correct. For a number of ...
In this paper we solve musical equational programs by means of higher order functions. The initial s...
We propose a new approach to the computer-assisted verification of functional programs. We work in f...