Roland Carl Backhouse

ORCID

Publication Activity (10 Years)

Years Active: 1976-2024
Publications (10 Years): 9

Top Venues

CoRR

J. Log. Algebraic Methods Program.

Sci. Comput. Program.

MPC

Imperial College London, UK (PHD)

Education History

Imperial College London, UK

PHD

Publications

Ed Voermans, Jules Desharnais, Roland Carl Backhouse
The Thins Ordering on Relations. CoRR (2024)
Roland Carl Backhouse, Ed Voermans
Diagonals and Block-Ordered Relations. CoRR (2024)
Roland Carl Backhouse, Ed Voermans
The Index and Core of a Relation. With Applications to the Axiomatics of Relation Algebra. CoRR (2023)
Roland Carl Backhouse, José Nuno Oliveira
On difunctions. J. Log. Algebraic Methods Program. 134 (2023)
Roland Carl Backhouse, Henk Doornbos, Roland Glück, Jaap van der Woude
Components and acyclicity of graphs. An exercise in combining precision with concision. J. Log. Algebraic Methods Program. 124 (2022)
Roland Carl Backhouse
An Analysis of Repeated Graph Search. MPC (2019)
Roland Carl Backhouse
Factor theory and the unity of opposites. J. Log. Algebraic Methods Program. 85 (5) (2016)
Roland Carl Backhouse, João F. Ferreira
On Euclid's Algorithm and Elementary Number Theory. CoRR (2015)
Roland Carl Backhouse, Hai Truong
The capacity-C torch problem. Sci. Comput. Program. 102 (2015)
Roland Carl Backhouse
First-past-the-post games. Sci. Comput. Program. 85 (2014)
Alexandra Mendes, Roland Carl Backhouse, João Fernando Ferreira
Structure Editing of Handwritten Mathematics: Improving the Computer Support for the Calculational Method. ITS (2014)
Roland Carl Backhouse, Wei Chen, João F. Ferreira
The algorithmics of solitaire-like games. Sci. Comput. Program. 78 (11) (2013)
Roland Carl Backhouse
First-Past-the-Post Games. MPC (2012)
Roland Carl Backhouse, João F. Ferreira
On Euclid's algorithm and elementary number theory. Sci. Comput. Program. 76 (3) (2011)
Roland Carl Backhouse, Wei Chen, João F. Ferreira
The Algorithmics of Solitaire-Like Games. MPC (2010)
João F. Ferreira, Alexandra Mendes, Roland Carl Backhouse, Luís Soares Barbosa
Which Mathematics for the Information Society? TFM (2009)
Roland Carl Backhouse, Richard S. Bird, Paul F. Hoogendijk
Meeting a fanclub: a lattice of generic shape selectors. WGP@ICFP (2009)
Roland Carl Backhouse
The Capacity-CTorch Problem. MPC (2008)
Roland Carl Backhouse, Henk Doornbos
Datatype-Generic Termination Proofs. Theory Comput. Syst. 43 (3-4) (2008)
Roland Carl Backhouse, João F. Ferreira
Recounting the Rationals: Twice!. MPC (2008)
Roland Carl Backhouse, Diethard Michaelis
Exercises in Quantifier Manipulation. MPC (2006)
Roland Carl Backhouse
Regular algebra applied to language problems. J. Log. Algebraic Methods Program. 66 (2) (2006)
Roland Carl Backhouse
Datatype-Generic Reasoning. CiE (2006)
Ondrej Rypacek, Roland Carl Backhouse, Henrik Nilsson
Type-theoretic design patterns. ICFP-WGP (2006)
Roland Carl Backhouse
Algebraic Approaches to Problem Generalisation. AMAST (2004)
Kevin Backhouse, Roland Carl Backhouse
Safety of abstract interpretations for free, via logical relations and Galois connections. Sci. Comput. Program. 51 (1-2) (2004)
Roland Carl Backhouse, Paul F. Hoogendijk
Generic Properties of Datatypes. Generic Programming (2003)
Roland Carl Backhouse, Diethard Michaelis
Fixed-Point Characterisation of Winning Strategies in Impartial Games. RelMiCS (2003)
Kevin Backhouse, Roland Carl Backhouse
Logical Relations and Galois Connections. MPC (2002)
Roland Carl Backhouse
Fusion on Languages. ESOP (2001)
Roland Carl Backhouse, Maarten M. Fokkinga
The associativity of equivalence and the Towers of Hanoi problem. Inf. Process. Lett. 77 (2-4) (2001)
Henk Doornbos, Roland Carl Backhouse
Algebra of Program Termination. Algebraic and Coalgebraic Methods in the Mathematics of Program Construction (2000)
Roland Carl Backhouse
Galois Connections and Fixed Point Calculus. Algebraic and Coalgebraic Methods in the Mathematics of Program Construction (2000)
Roland Carl Backhouse, Paul F. Hoogendijk
Final dialgebras: From categories to allegories. RAIRO Theor. Informatics Appl. 33 (4/5) (1999)
Richard Verhoeven, Roland Carl Backhouse
Interfacing Program Construction and Verification. World Congress on Formal Methods (1999)
Roland Carl Backhouse
Pair Algebras and Galois Connections. Inf. Process. Lett. 67 (4) (1998)
Roland Carl Backhouse, Patrik Jansson, Johan Jeuring, Lambert G. L. T. Meertens
Generic Programming: An Introduction. Advanced Functional Programming (1998)
Matteo Vaccari, Roland Carl Backhouse
Calculating a Round-Robin Scheduler. MPC (1998)
Roland Carl Backhouse
Pair algebras and Galois connections. RelMiCS (1998)
Roland Carl Backhouse, Richard Verhoeven, Olaf Weber
Math/pad: A System for On-Line Preparation of Mathematical Documents. Softw. Concepts Tools 18 (2) (1997)
Matteo Vaccari, Roland Carl Backhouse
Deriving a systolic regular language recognizer. Algorithmic Languages and Calculi (1997)
Paul F. Hoogendijk, Roland Carl Backhouse
When Do Datatypes Commute? Category Theory and Computer Science (1997)
Henk Doornbos, Roland Carl Backhouse, Jaap van der Woude
A Calculational Approach to Mathematical Induction. Theor. Comput. Sci. 179 (1-2) (1997)
Henk Doornbos, Roland Carl Backhouse
Reductivity. Sci. Comput. Program. 26 (1-3) (1996)
Roland Carl Backhouse
Mathematics of Program Construction. Sci. Comput. Program. 26 (1-3) (1996)
Henk Doornbos, Roland Carl Backhouse
Induction and Recursion on Datatypes. MPC (1995)
Roland Carl Backhouse, Marcel Bijsterveld, Rik van Geldrop, Jaap van der Woude
Categorical Fixed Point Calculus. Category Theory and Computer Science (1995)
Chritiene Aarts, Roland Carl Backhouse, Eerke A. Boiten, Henk Doornbos, Netty van Gasteren, Rik van Geldrop, Paul F. Hoogendijk, Ed Voermans, Jaap van der Woude
Fixed-Point Calculus. Inf. Process. Lett. 53 (3) (1995)
Paul F. Hoogendijk, Roland Carl Backhouse
Relational Programming Laws in the Tree, List, Bag, Set Hierarchy. Sci. Comput. Program. 22 (1-2) (1994)
Roland Carl Backhouse, J. P. H. W. van den Eijnde, A. J. M. van Gasteren
Calculating Path Algorithms. Sci. Comput. Program. 22 (1-2) (1994)
Roland Carl Backhouse, Jaap van der Woude
Demonic Operators and Monotype Factors. Math. Struct. Comput. Sci. 3 (4) (1993)
Roland Carl Backhouse, Paul F. Hoogendijk
Elements of a Relational Theory of Datatypes. Formal Program Development (1993)
Roland Carl Backhouse, A. J. M. van Gasteren
Calculating a Path Algorithm. MPC (1992)
Roland Carl Backhouse, Peter J. de Bruin, Paul F. Hoogendijk, Grant Malcolm, Ed Voermans, Jaap van der Woude
Polynomial Relators (Extended Abstract). AMAST (1991)
Roland Carl Backhouse, Grant Malcolm
On induced congruences. Bull. EATCS 40 (1990)
Roland Carl Backhouse, Paul Chisholm
Do-It-Yourself Type Theory. Formal Aspects Comput. 1 (1) (1989)
Roland Carl Backhouse, A. Khamiss
A While-Rule in Martin-Löf's Theory of Types. Comput. J. 30 (1) (1987)
Roland Carl Backhouse
Global Data Flow Analysis Problems Arising in Locally Least-Cost Error Recovery. ACM Trans. Program. Lang. Syst. 6 (2) (1984)
Stuart Oliver Anderson, Roland Carl Backhouse, E. H. Bugge, C. P. Stirling
An Assessment of Locally Least-Cost Error Recovery. Comput. J. 26 (1) (1983)
Roland Carl Backhouse
Writing a Number as a Sum of Two Squares: A New Solution. Inf. Process. Lett. 14 (1) (1982)
Stuart Oliver Anderson, Roland Carl Backhouse
An Alternative Implementation of an Insertion-Only Recovery Technique. Acta Informatica 18 (1982)
Stuart Oliver Anderson, Roland Carl Backhouse
Locally Least-Cost Error Recovery in Early's Algorithm. ACM Trans. Program. Lang. Syst. 3 (3) (1981)
Roland Carl Backhouse, R. K. Lutz
Factor Graphs, Failure Functions and BI-Trees. ICALP (1977)
Roland Carl Backhouse
Parsers. Acta Informatica 6 (1976)

Roland Carl Backhouse.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Roland Carl Backhouse