In this chapter we examine ways in which functional programs can be proved correct. For a number of reasons this is easier for functional than for impera-tive programs. In the simplest cases functional programs are equations, so the language documents itself, as it were. Beyond this we often have a higher-leve
The functional programming style describes computations concisely. The applicative nature of functio...
AbstractIn modern functional logic languages like Curry or Toy, programs are possibly non-confluent ...
In this paper we study the relationships between logic programming and functional programming, tryin...
The significance of functional programming is revealed as that the feasible approach to language ext...
A good way of developing a correct program is to calculate it from its specification. Functional pro...
This thesis addresses the problem of avoiding errors in functional programs. The thesis has three pa...
It is often claimed that functional programming languages, and in particular pure functional langua...
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...
This thesis consists of two parts. Both concern reasoning about non-strict functional programming la...
This document gives a quick tutorial introduction to a functional program verification. In the f...
We express implementations of functional languages as a succession of program transformations in a c...
ing out and studying those patterns of computation as useful objects in their own right leads to fur...
Abstract. Higher-order logic proof systems combine functional programming with logic, providing func...
In modern functional logic languages like Curry or Toy, programs are possibly non-confluent and non-...
The functional programming style describes computations concisely. The applicative nature of functio...
AbstractIn modern functional logic languages like Curry or Toy, programs are possibly non-confluent ...
In this paper we study the relationships between logic programming and functional programming, tryin...
The significance of functional programming is revealed as that the feasible approach to language ext...
A good way of developing a correct program is to calculate it from its specification. Functional pro...
This thesis addresses the problem of avoiding errors in functional programs. The thesis has three pa...
It is often claimed that functional programming languages, and in particular pure functional langua...
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...
This thesis consists of two parts. Both concern reasoning about non-strict functional programming la...
This document gives a quick tutorial introduction to a functional program verification. In the f...
We express implementations of functional languages as a succession of program transformations in a c...
ing out and studying those patterns of computation as useful objects in their own right leads to fur...
Abstract. Higher-order logic proof systems combine functional programming with logic, providing func...
In modern functional logic languages like Curry or Toy, programs are possibly non-confluent and non-...
The functional programming style describes computations concisely. The applicative nature of functio...
AbstractIn modern functional logic languages like Curry or Toy, programs are possibly non-confluent ...
In this paper we study the relationships between logic programming and functional programming, tryin...