|
77
|
Algebraic Data Types and Program Transformation
– G R Malcolm
- 1990
|
|
7
|
Shorter paths to graph algorithms
– B Moller, M Russling
- 1994
|
|
45
|
A fixpoint theorem for complete categories
– Joachim Lambek
- 1968
|
|
25
|
Regular algebra applied to path-finding problems
– R. C. Backhouse, B. A. Carre
- 1975
|
|
292
|
Theorems for free!
– Philip Wadler
- 1989
|
|
25
|
der Woude. A relational theory of datatypes. Available via World-Wide Web at http://www.cs.nott.ac.uk/~rcb/MPC/papers
– R C Backhouse, T S Voermans, J van
- 1992
|
|
15
|
Induction and Recursion on Datatypes
– Roland Backhouse, Henk Doornbos
- 1995
|
|
1312
|
A Discipline of Programming
– Edsger Dijkstra
- 1976
|
|
458
|
Programming from Specifications
– C Morgan
- 1994
|
|
215
|
Predicate Calculus and Program Semantics
– E W Dijkstra, C Scholten
- 1990
|
|
20
|
Algorithms and Data Structures: Design, Correctness, Analysis
– J H Kingston
- 1990
|
|
3
|
der Woude. A relational theory of datatypes. Working document
– C J Aarts, R C Backhouse, P Hoogendijk, E Voermans, J van
- 1992
|
|
3
|
A General Scheme for Breadth-First Graph Traversal
– Martin Russling
- 1995
|
|
38
|
Graph theory applications
– L R Foulds
- 1992
|
|
233
|
Regular Algebra and Finite Machines
– J Conway
- 1971
|
|
4
|
Mathematical Induction Made Calculational
– Roland Backhouse, Henk Doornbos
- 1994
|
|
3
|
Constructive Lattice Theory
– Roland Backhouse
- 1993
|
|
2
|
Categorical fixed point rules. Graduating Dissertation
– Marcel Bijsterveld
- 1994
|
|
2
|
An algebraic view of structural induction. Extended Abstract
– Claudio A Hermida, Bart Jacobs
- 1994
|
