54

Revisiting Catamorphisms over Datatypes with Embedded Functions (or, Programs from Outer Space)
– Leonidas Fegaras, Tim Sheard
 1996

14

The Treewidth of Java Programs
– Jens Gustedt, Ole A. MÃ¦hle, Jan Arne Telle
 2002

53

Structured Programs have Small TreeWidth and Good Register Allocation
– Mikkel Thorup
 1995

73

Graph expressions and graph rewritings
– M BAUDERON, B COURCELLE
 1987

66

Automatic generation of lineartime algorithms from predicate calculus descriptions of problems on recursively constructed graph families
– R Borie, R Parker, C Tovey
 1992

69

An algebraic theory of graph reduction
– S Arnborg, B Courcelle, A Proskurowski, D Seese
 1993

29

Functional Programming with Graphs
– Martin Erwig
 1997

7

Shorter paths to graph algorithms
– B Moller, M Russling
 1994

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 BreadthFirst Graph Traversal
– Martin Russling
 1995

1

A class of graph algorithms. Qualifying dissertation for transfer to DPhil status
– J N Ravelo
 1996

10

Calculating A Path Algorithm
– Roland C. Backhouse, A. J. M. Van Gasteren
 1992

55

The weakest prespecification
– C A R Hoare, J He
 1986

477

Programming from Specifications
– C C Morgan
 1998

45

Graph Theory Applications
– L R Foulds
 1992

8557

R.: Introduction to Algorithms
– T Cormen, C Leiserson, Rivest
 1990

1404

A Discipline of Programming
– E W Dijkstra
 1976

53

Programming: The derivation of algorithms
– A Kaldewaij
 1990
