#### Filter Results:

- Full text PDF available (14)

#### Publication Year

1991

2009

- This year (0)
- Last five years (0)

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- Paul F. Hoogendijk, Oege de Moor
- J. Funct. Program.
- 2000

A point-free calculus of so-called \collection types" is presented, similar to the monadic calculus of Tannen, Buneman and Wong. We observe that our calculus is parametrised by a monad thus making the calculus \polytypic". A n o vel contribution of the paper is to discuss situations in which a single application involves more than one collection type. In… (More)

- Roland Carl Backhouse, Paul F. Hoogendijk
- Formal Program Development
- 1993

The \Boom hierarchy" is a hierarchy of types that begins at the level of trees and includes lists, bags and sets. This hierarchy forms the basis for the calculus of total functions developed by Bird and Meertens, and which has become known as the \Bird-Meertens formalism". This paper describes a hierarchy of types that logically precedes the Boom hierarchy.… (More)

- Richard S. Bird, Oege de Moor, Paul F. Hoogendijk
- J. Funct. Program.
- 1996

- Chritiene Aarts, Roland Carl Backhouse, +6 authors Jaap van der Woude
- Inf. Process. Lett.
- 1995

- Paul F. Hoogendijk, Roland Carl Backhouse
- Category Theory and Computer Science
- 1997

Polytypic programs are programs that are parameterised by type constructors (like List), unlike polymorphic programs which are parameterised by types (like Int). In this paper we formulate precisely the polytypic programming problem of \commut-ing" two datatypes. The precise formulation involves a novel notion of higher order polymorphism. We demonstrate… (More)

- Paul F. Hoogendijk, Roland Carl Backhouse
- Sci. Comput. Program.
- 1994

In this paper we demonstrate that the basic rules and calculational techniques used in two extensively documented program derivation methods can be expressed, and, indeed, can be generalised within a relational theory of datatypes. The two methods to which we refer are the so-called " Bird-Meertens formalism " for the construction of functional programs and… (More)

- Paul F. Hoogendijk
- MPC
- 1992

In this paper we demonstrate that the basic rules and calcu-lational techniques used in two extensively documented program derivation methods can be expressed, and, indeed, can be generalised within a relational theory of datatypes. The two methods to which we refer are the so-called \Bird-Meertens formalism" (see 22]) and the \Dijkstra-Feijen calculus"… (More)