- A relational perspective on types with laws Ed Voermans Jaap van der Woude
- The Associativity of Equivalence and the Towers of Hanoi Problem
- Matsad: A System for OnLine Preparation of Mathematical Documents
- On Euclid's Algorithm and Elementary Number Theory Roland Backhouse, Jo~ao F. Ferreira1
- A Calculational Approach to Mathematical Induction Henk Doornbos, Roland Backhouse and Jaap van der Woude
- Mathematics and Programming A Revolution in the Art of Effective Reasoning
- Extracting Proofs from Documents Roland Backhouse and Richard Verhoeven \Lambda
- Induction and Recursion on Datatypes
- (Relational) Programming Laws Boom Hierarchy of Types
- Reductivity Arguments and Program Construction Doornbos, Henk
- Domain Operators and Domain Kinds Roland Backhouse
- EINDHOVEN UNIVERSITY OF TECHNOLOGY Department of Mathematics and Computing Science
- Demonic Operators and Monotype Factors Roland Backhouse and Jaap van der Woude
- Final Dialgebras: From Categories to Allegories Roland Backhouse and Paul Hoogendijk \Lambda
- Safety of Abstract Interpretations for Free, via Logical Relations and Galois Connections
- Tool Support for the Calculational Method Roland Backhouse and Richard Verhoeven
- Deriving a systolic regular language recognizer Matteo Vaccari
- Fusion on Languages Extended Abstract
- Transformational derivation of (parallel) programs using skeletons \Lambda
- The Capacity-C Torch Problem Roland Backhouse #
- Elements of a Relational Theory of Datatypes Roland Backhouse and Paul Hoogendijk
- An Exploration of the BirdMeertens Roland Backhouse
- Generic Programming { An Introduction {
- EINDHOVEN tue UNIVERSITY OF TECHNOLOGY Department of Mathematics and Computing Science
- Categorical Fixed Point Calculus Roland Backhouse, Marcel Bijsterveld,
- Calculating a RoundRobin Scheduler Matteo Vaccari \Lambda Roland Backhouse y
- When do datatypes commute? Paul Hoogendijk and Roland Backhouse
- Which Mathematics for the Information Society? Jo~ao F. Ferreira1
- Towards Tool Support for Program Veri cation and Construction
- Logical Relations and Galois Connections Kevin Backhouse 1 and Roland Backhouse 2
- Acknowledgements Many people supported me in preparing this thesis, and their help is gratefully acknowledged.
- Principles and Applications Algorithmic Problem Solving
- Designing an Algorithmic Proof of the Two-Squares Theorem
- Meeting a Fanclub: A Lattice of Generic Shape Selectors1 Roland Backhouse
- Datatype-Generic Termination Proofs Roland Backhouse and Henk Doornbos
- Datatype-Generic Reasoning Roland Backhouse
- Pair Algebras and Galois Connections Roland Backhouse
- Recounting the Rationals: Twice! Roland Backhouse and Joo F. Ferreira
- Fixed-Point Characterisation of Winning Strategies in Impartial Games
- Constructive Lattice Theory Roland Backhouse
- Fixed Point Calculus Roland Backhouse
- Find Re ned Roland Backhouse
- A Calculational Presentation of The Theory of Impartial Two-Person Games
- CALCULATING A PATH ALGORITHM Roland C. Backhouse and A.J.M. van Gasteren
- A Class of Commuting Relators Roland Backhouse, Henk Doornbos and Paul Hoogendijk
- Monad Decomposition Roland C. Backhouse
- Regular Algebra Applied to Language Problems Roland Backhouse #
- Inductive Datatypes with Laws and Subtyping A Relational Model
- Generic Properties of Datatypes Roland Backhouse
- A database calculus based on strong monads and partial Eerke Boiten and Paul Hoogendijk \Lambda
- First-past-the-post and Penney-Ante Games Roland Backhouse
- Category Theory Coherently Constructive Lattice Theory
- Making Formality Work For Us Roland Backhouse
- A RELATIONAL THEORY OF Chritiene Aarts 1 Roland Backhouse 2 Paul Hoogendijk \Lambda
- Mathematics of Recursive Program Construction Henk Doornbos Roland Backhouse yz
- Reductivity Henk Doornbos and Roland Backhouse
- Category Theory as Coherently Constructive Lattice Theory
- The Algorithmics of Solitaire-Like Games Roland Backhouse, Wei Chen, Jo~ao F. Ferreira1
