Calculating A Path Algorithm (1992)

Cached

Download Links

by Roland C. Backhouse , A. J. M. Van Gasteren
Venue:Science of Computer Programming
Citations:10 - 2 self

Documents Related by Co-Citation

30 Regular algebra applied to path-finding problems – R. C. Backhouse, B. A. Carre - 1975
84 Algebraic Data Types and Program Transformation – G Malcolm - 1990
7 Shorter paths to graph algorithms – B Moller, M Russling - 1994
52 A fixpoint theorem for complete categories – J Lambek - 1968
1065 Introduction to lattices and order – B A Davey, H A Priestley - 2002
326 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
16 Induction and Recursion on Datatypes – Roland Backhouse, Henk Doornbos - 1995
477 Programming from Specifications – C C Morgan - 1998
1404 A Discipline of Programming – E W Dijkstra - 1976
226 Predicate Calculus and Program Semantics – E W Dijkstra, C S 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
45 Graph Theory Applications – L R Foulds - 1992
279 Regular Algebra and Finite Machines – J H 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