Roland Carl Backhouse

According to our database, Roland Carl Backhouse authored at least 65 papers between 1976 and 2024.

Collaborative distances:

• Dijkstra number of two.
• Erdős number of four.

2024

Diagonals and Block-Ordered Relations.

Roland Carl Backhouse, Ed Voermans

CoRR, 2024

The Thins Ordering on Relations.

Ed Voermans, Jules Desharnais, Roland Carl Backhouse

CoRR, 2024

2023

On difunctions.

Roland Carl Backhouse, José Nuno Oliveira

J. Log. Algebraic Methods Program., August, 2023

The Index and Core of a Relation. With Applications to the Axiomatics of Relation Algebra.

Roland Carl Backhouse, Ed Voermans

CoRR, 2023

2022

Components and acyclicity of graphs. An exercise in combining precision with concision.

Roland Carl Backhouse, Henk Doornbos, Roland Glück, Jaap van der Woude

J. Log. Algebraic Methods Program., 2022

2019

An Analysis of Repeated Graph Search.

Roland Carl Backhouse

Proceedings of the Mathematics of Program Construction - 13th International Conference, 2019

2016

Factor theory and the unity of opposites.

Roland Carl Backhouse

J. Log. Algebraic Methods Program., 2016

2015

The capacity-C torch problem.

Roland Carl Backhouse, Hai Truong

Sci. Comput. Program., 2015

2014

First-past-the-post games.

Roland Carl Backhouse

Sci. Comput. Program., 2014

Structure Editing of Handwritten Mathematics: Improving the Computer Support for the Calculational Method.

Alexandra Mendes, Roland Carl Backhouse, João F. Ferreira

Proceedings of the Ninth ACM International Conference on Interactive Tabletops and Surfaces, 2014

2013

The algorithmics of solitaire-like games.

Roland Carl Backhouse, Wei Chen, João F. Ferreira

Sci. Comput. Program., 2013

2011

On Euclid's algorithm and elementary number theory.

Roland Carl Backhouse, João F. Ferreira

Sci. Comput. Program., 2011

2009

Which Mathematics for the Information Society?

João F. Ferreira, Alexandra Mendes, Roland Carl Backhouse, Luís Soares Barbosa

Proceedings of the Teaching Formal Methods, Second International Conference, 2009

Meeting a fanclub: a lattice of generic shape selectors.

Roland Carl Backhouse, Richard S. Bird, Paul F. Hoogendijk

Proceedings of the 2009 ACM SIGPLAN workshop on Generic programming, 2009

2008

Datatype-Generic Termination Proofs.

Roland Carl Backhouse, Henk Doornbos

Theory Comput. Syst., 2008

Recounting the Rationals: Twice!.

Roland Carl Backhouse, João F. Ferreira

Proceedings of the Mathematics of Program Construction, 9th International Conference, 2008

The Capacity-CTorch Problem.

Roland Carl Backhouse

Proceedings of the Mathematics of Program Construction, 9th International Conference, 2008

2006

Regular algebra applied to language problems.

Roland Carl Backhouse

J. Log. Algebraic Methods Program., 2006

Exercises in Quantifier Manipulation.

Roland Carl Backhouse, Diethard Michaelis

Proceedings of the Mathematics of Program Construction, 8th International Conference, 2006

Type-theoretic design patterns.

Ondrej Rypacek, Roland Carl Backhouse, Henrik Nilsson

Proceedings of the ACM SIGPLAN Workshop on Generic Programming, 2006

Datatype-Generic Reasoning.

Roland Carl Backhouse

Proceedings of the Logical Approaches to Computational Barriers, 2006

2004

Safety of abstract interpretations for free, via logical relations and Galois connections.

Kevin Backhouse, Roland Carl Backhouse

Sci. Comput. Program., 2004

Algebraic Approaches to Problem Generalisation.

Roland Carl Backhouse

Proceedings of the Algebraic Methodology and Software Technology, 2004

2003

Generic Properties of Datatypes.

Roland Carl Backhouse, Paul F. Hoogendijk

Proceedings of the Generic Programming - Advanced Lectures, 2003

Fixed-Point Characterisation of Winning Strategies in Impartial Games.

Roland Carl Backhouse, Diethard Michaelis

Proceedings of the Relational and Kleene-Algebraic Methods in Computer Science: 7th International Seminar on Relational Methods in Computer Science and 2nd International Workshop on Applications of Kleene Algebra, 2003

2002

Logical Relations and Galois Connections.

Kevin Backhouse, Roland Carl Backhouse

Proceedings of the Mathematics of Program Construction, 6th International Conference, 2002

2001

The associativity of equivalence and the Towers of Hanoi problem.

Roland Carl Backhouse, Maarten M. Fokkinga

Inf. Process. Lett., 2001

Fusion on Languages.

Roland Carl Backhouse

Proceedings of the Programming Languages and Systems, 2001

2000

Algebra of Program Termination.

Henk Doornbos, Roland Carl Backhouse

Proceedings of the Algebraic and Coalgebraic Methods in the Mathematics of Program Construction, 2000

Galois Connections and Fixed Point Calculus.

Roland Carl Backhouse

Proceedings of the Algebraic and Coalgebraic Methods in the Mathematics of Program Construction, 2000

1999

Final dialgebras: From categories to allegories.

Roland Carl Backhouse, Paul F. Hoogendijk

RAIRO Theor. Informatics Appl., 1999

Interfacing Program Construction and Verification.

Richard Verhoeven, Roland Carl Backhouse

Proceedings of the FM'99 - Formal Methods, 1999

1998

Pair Algebras and Galois Connections.

Roland Carl Backhouse

Inf. Process. Lett., 1998

Calculating a Round-Robin Scheduler.

Matteo Vaccari, Roland Carl Backhouse

Proceedings of the Mathematics of Program Construction, 1998

Generic Programming: An Introduction.

Roland Carl Backhouse, Patrik Jansson, Johan Jeuring, Lambert G. L. T. Meertens

Proceedings of the Advanced Functional Programming, 1998

1997

A Calculational Approach to Mathematical Induction.

Henk Doornbos, Roland Carl Backhouse, Jaap van der Woude

Theor. Comput. Sci., 1997

Math/pad: A System for On-Line Preparation of Mathematical Documents.

Roland Carl Backhouse, Richard Verhoeven, Olaf Weber

Softw. Concepts Tools, 1997

When Do Datatypes Commute?

Paul F. Hoogendijk, Roland Carl Backhouse

Proceedings of the Category Theory and Computer Science, 7th International Conference, 1997

Deriving a systolic regular language recognizer.

Matteo Vaccari, Roland Carl Backhouse

Proceedings of the Algorithmic Languages and Calculi, 1997

Programs and Datatypes.

Henk Doornbos, Netty van Gasteren, Roland Carl Backhouse

Proceedings of the Relational Methods in Computer Science., 1997

1996

Reductivity.

Henk Doornbos, Roland Carl Backhouse

Sci. Comput. Program., 1996

Mathematics of Program Construction.

Roland Carl Backhouse

Sci. Comput. Program., 1996

1995

Fixed-Point Calculus.

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

Inf. Process. Lett., 1995

Induction and Recursion on Datatypes.

Henk Doornbos, Roland Carl Backhouse

Proceedings of the Mathematics of Program Construction, 1995

Categorical Fixed Point Calculus.

Roland Carl Backhouse, Marcel Bijsterveld, Rik van Geldrop, Jaap van der Woude

Proceedings of the Category Theory and Computer Science, 6th International Conference, 1995

1994

Relational Programming Laws in the Tree, List, Bag, Set Hierarchy.

Paul F. Hoogendijk, Roland Carl Backhouse

Sci. Comput. Program., 1994

Calculating Path Algorithms.

Roland Carl Backhouse, J. P. H. W. van den Eijnde, A. J. M. van Gasteren

Sci. Comput. Program., 1994

1993

Demonic Operators and Monotype Factors.

Roland Carl Backhouse, Jaap van der Woude

Math. Struct. Comput. Sci., 1993

Elements of a Relational Theory of Datatypes.

Roland Carl Backhouse, Paul F. Hoogendijk

Proceedings of the Formal Program Development - IFIP TC2/WG 2.1 State-of-the-Art Report, 1993

1992

Calculating a Path Algorithm.

Roland Carl Backhouse, A. J. M. van Gasteren

Proceedings of the Mathematics of Program Construction, Second International Conference, Oxford, UK, June 29, 1992

1991

Polynomial Relators (Extended Abstract).

Roland Carl Backhouse, Peter J. de Bruin, Paul F. Hoogendijk, Grant Malcolm, Ed Voermans, Jaap van der Woude

Proceedings of the Algebraic Methodology and Software Technology (AMAST '91), 1991

1990

On induced congruences.

Roland Carl Backhouse, Grant Malcolm

Bull. EATCS, 1990

1989

Do-It-Yourself Type Theory.

Roland Carl Backhouse, Paul Chisholm

Formal Aspects Comput., 1989

1987

A While-Rule in Martin-Löf's Theory of Types.

Roland Carl Backhouse, A. Khamiss

Comput. J., 1987

1986

Program construction and verification.

Roland Carl Backhouse

PHI Series in computer science, Prentice Hall, ISBN: 978-0-13-729146-5, 1986

1984

Global Data Flow Analysis Problems Arising in Locally Least-Cost Error Recovery.

Roland Carl Backhouse

ACM Trans. Program. Lang. Syst., 1984

1983

An Assessment of Locally Least-Cost Error Recovery.

Stuart Oliver Anderson, Roland Carl Backhouse, E. H. Bugge, C. P. Stirling

Comput. J., 1983

1982

Writing a Number as a Sum of Two Squares: A New Solution.

Roland Carl Backhouse

Inf. Process. Lett., 1982

An Alternative Implementation of an Insertion-Only Recovery Technique.

Stuart Oliver Anderson, Roland Carl Backhouse

Acta Informatica, 1982

1981

Locally Least-Cost Error Recovery in Early's Algorithm.

Stuart Oliver Anderson, Roland Carl Backhouse

ACM Trans. Program. Lang. Syst., 1981

1979

Least-cost repair of syntax errors.

Roland Carl Backhouse, Stuart Oliver Anderson

ACM SIGPLAN Notices, 1979

Syntax of Programming Languages: Theory and Practice

Roland Carl Backhouse

Prentice-Hall, ISBN: 0-13-879999-7, 1979

1977

Factor Graphs, Failure Functions and BI-Trees.

Roland Carl Backhouse, R. K. Lutz

Proceedings of the Automata, 1977

1976

Closure algorithms and the star-height problem of regular languages.

Roland Carl Backhouse

PhD thesis, 1976

An Alternative Approach to the Improvement of <i>LR(k)</i> Parsers.

Roland Carl Backhouse

Acta Informatica, 1976