default search action
Roland Carl Backhouse
Person information
- affiliation: University of Nottingham, UK
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [i4]Ed Voermans, Jules Desharnais, Roland Carl Backhouse:
The Thins Ordering on Relations. CoRR abs/2401.16888 (2024) - [i3]Roland Carl Backhouse, Ed Voermans:
Diagonals and Block-Ordered Relations. CoRR abs/2401.17130 (2024) - 2023
- [j31]Roland Carl Backhouse
, José Nuno Oliveira
On difunctions. J. Log. Algebraic Methods Program. 134: 100878 (2023) - [i2]Roland Carl Backhouse, Ed Voermans:
The Index and Core of a Relation. With Applications to the Axiomatics of Relation Algebra. CoRR abs/2309.02017 (2023) - 2022
- [j30]Roland Carl Backhouse
Components and acyclicity of graphs. An exercise in combining precision with concision. J. Log. Algebraic Methods Program. 124: 100730 (2022)
2010 – 2019
- 2019
- [c30]Roland Carl Backhouse
An Analysis of Repeated Graph Search. MPC 2019: 298-328 - 2016
- [j29]Roland Carl Backhouse
Factor theory and the unity of opposites. J. Log. Algebraic Methods Program. 85(5): 824-846 (2016) - 2015
- [j28]Roland Carl Backhouse
The capacity-C torch problem. Sci. Comput. Program. 102: 76-107 (2015) - [i1]Roland Carl Backhouse, João F. Ferreira:
On Euclid's Algorithm and Elementary Number Theory. CoRR abs/1506.05981 (2015) - 2014
- [j27]Roland Carl Backhouse
First-past-the-post games. Sci. Comput. Program. 85: 166-203 (2014) - [c29]Alexandra Mendes
Structure Editing of Handwritten Mathematics: Improving the Computer Support for the Calculational Method. ITS 2014: 139-148 - 2013
- [j26]Roland Carl Backhouse
The algorithmics of solitaire-like games. Sci. Comput. Program. 78(11): 2029-2046 (2013) - 2012
- [c28]Roland Carl Backhouse:
First-Past-the-Post Games. MPC 2012: 157-176 - 2011
- [j25]Roland Carl Backhouse
On Euclid's algorithm and elementary number theory. Sci. Comput. Program. 76(3): 160-180 (2011) - 2010
- [c27]Roland Carl Backhouse
The Algorithmics of Solitaire-Like Games. MPC 2010: 1-18
2000 – 2009
- 2009
- [c26]Roland Carl Backhouse
Meeting a fanclub: a lattice of generic shape selectors. WGP@ICFP 2009: 73-84 - [c25]João F. Ferreira
Which Mathematics for the Information Society? TFM 2009: 39-56 - 2008
- [j24]Roland Carl Backhouse
Datatype-Generic Termination Proofs. Theory Comput. Syst. 43(3-4): 362-393 (2008) - [c24]Roland Carl Backhouse
The Capacity-CTorch Problem. MPC 2008: 57-78 - [c23]Roland Carl Backhouse
Recounting the Rationals: Twice!. MPC 2008: 79-91 - 2007
- [e4]Roland Carl Backhouse, Jeremy Gibbons, Ralf Hinze, Johan Jeuring:
Datatype-Generic Programming - International Spring School, SSDGP 2006, Nottingham, UK, April 24-27, 2006, Revised Lectures. Lecture Notes in Computer Science 4719, Springer 2007, ISBN 978-3-540-76785-5 [contents] - 2006
- [j23]Roland Carl Backhouse
Regular algebra applied to language problems. J. Log. Algebraic Methods Program. 66(2): 71-111 (2006) - [c22]Roland Carl Backhouse
Datatype-Generic Reasoning. CiE 2006: 21-34 - [c21]Ondrej Rypacek, Roland Carl Backhouse, Henrik Nilsson:
Type-theoretic design patterns. ICFP-WGP 2006: 13-22 - [c20]Roland Carl Backhouse
Exercises in Quantifier Manipulation. MPC 2006: 69-81 - 2004
- [j22]Kevin Backhouse, Roland Carl Backhouse
Safety of abstract interpretations for free, via logical relations and Galois connections. Sci. Comput. Program. 51(1-2): 153-196 (2004) - [c19]Roland Carl Backhouse
Algebraic Approaches to Problem Generalisation. AMAST 2004: 1-2 - 2003
- [c18]Roland Carl Backhouse, Diethard Michaelis:
Fixed-Point Characterisation of Winning Strategies in Impartial Games. RelMiCS 2003: 34-47 - [c17]Roland Carl Backhouse, Paul F. Hoogendijk:
Generic Properties of Datatypes. Generic Programming 2003: 97-132 - [e3]Roland Carl Backhouse, Jeremy Gibbons:
Generic Programming - Advanced Lectures. Lecture Notes in Computer Science 2793, Springer 2003, ISBN 3-540-20194-7 [contents] - 2002
- [c16]Kevin Backhouse, Roland Carl Backhouse
Logical Relations and Galois Connections. MPC 2002: 23-39 - [e2]Roland Carl Backhouse, Roy L. Crole, Jeremy Gibbons:
Algebraic and Coalgebraic Methods in the Mathematics of Program Construction, International Summer School and Workshop, Oxford, UK, April 10-14, 2000, Revised Lectures. Lecture Notes in Computer Science 2297, Springer 2002, ISBN 3-540-43613-8 [contents] - 2001
- [j21]Roland Carl Backhouse
The associativity of equivalence and the Towers of Hanoi problem. Inf. Process. Lett. 77(2-4): 71-76 (2001) - [c15]Roland Carl Backhouse:
Fusion on Languages. ESOP 2001: 107-121 - 2000
- [c14]Roland Carl Backhouse:
Galois Connections and Fixed Point Calculus. Algebraic and Coalgebraic Methods in the Mathematics of Program Construction 2000: 89-148 - [c13]Henk Doornbos, Roland Carl Backhouse:
Algebra of Program Termination. Algebraic and Coalgebraic Methods in the Mathematics of Program Construction 2000: 203-236 - [e1]Roland Carl Backhouse, José Nuno Oliveira:
Mathematics of Program Construction, 5th International Conference, MPC 2000, Ponte de Lima, Portugal, July 3-5, 2000, Proceedings. Lecture Notes in Computer Science 1837, Springer 2000, ISBN 3-540-67727-5 [contents]
1990 – 1999
- 1999
- [j20]Roland Carl Backhouse
Final dialgebras: From categories to allegories. RAIRO Theor. Informatics Appl. 33(4/5): 401-426 (1999) - [c12]Richard Verhoeven, Roland Carl Backhouse:
Interfacing Program Construction and Verification. World Congress on Formal Methods 1999: 1128-1146 - 1998
- [j19]Roland Carl Backhouse:
Pair Algebras and Galois Connections. Inf. Process. Lett. 67(4): 169-175 (1998) - [c11]Roland Carl Backhouse:
Pair algebras and Galois connections. RelMiCS 1998: 8-12 - [c10]Roland Carl Backhouse, Patrik Jansson
Generic Programming: An Introduction. Advanced Functional Programming 1998: 28-115 - [c9]Matteo Vaccari, Roland Carl Backhouse:
Calculating a Round-Robin Scheduler. MPC 1998: 365-382 - 1997
- [j18]Roland Carl Backhouse, Richard Verhoeven, Olaf Weber:
Math/pad: A System for On-Line Preparation of Mathematical Documents. Softw. Concepts Tools 18(2): 80- (1997) - [j17]Henk Doornbos, Roland Carl Backhouse
A Calculational Approach to Mathematical Induction. Theor. Comput. Sci. 179(1-2): 103-135 (1997) - [c8]Matteo Vaccari, Roland Carl Backhouse:
Deriving a systolic regular language recognizer. Algorithmic Languages and Calculi 1997: 49-72 - [c7]Paul F. Hoogendijk, Roland Carl Backhouse:
When Do Datatypes Commute? Category Theory and Computer Science 1997: 242-260 - [p1]Henk Doornbos, Netty van Gasteren, Roland Carl Backhouse:
Programs and Datatypes. Relational Methods in Computer Science 1997: 150-165 - 1996
- [j16]Roland Carl Backhouse:
Mathematics of Program Construction. Sci. Comput. Program. 26(1-3): 5-9 (1996) - [j15]Henk Doornbos, Roland Carl Backhouse:
Reductivity. Sci. Comput. Program. 26(1-3): 217-236 (1996) - 1995
- [j14]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): 131-136 (1995) - [c6]Roland Carl Backhouse, Marcel Bijsterveld, Rik van Geldrop, Jaap van der Woude:
Categorical Fixed Point Calculus. Category Theory and Computer Science 1995: 159-179 - [c5]Henk Doornbos, Roland Carl Backhouse
Induction and Recursion on Datatypes. MPC 1995: 242-256 - 1994
- [j13]Roland Carl Backhouse
Calculating Path Algorithms. Sci. Comput. Program. 22(1-2): 3-19 (1994) - [j12]Paul F. Hoogendijk, Roland Carl Backhouse
Relational Programming Laws in the Tree, List, Bag, Set Hierarchy. Sci. Comput. Program. 22(1-2): 67-105 (1994) - 1993
- [j11]Roland Carl Backhouse
Demonic Operators and Monotype Factors. Math. Struct. Comput. Sci. 3(4): 417-433 (1993) - [c4]Roland Carl Backhouse, Paul F. Hoogendijk:
Elements of a Relational Theory of Datatypes. Formal Program Development 1993: 7-42 - 1992
- [c3]Roland Carl Backhouse, A. J. M. van Gasteren:
Calculating a Path Algorithm. MPC 1992: 32-44 - 1991
- [c2]Roland Carl Backhouse, Peter J. de Bruin, Paul F. Hoogendijk, Grant Malcolm, Ed Voermans, Jaap van der Woude:
Polynomial Relators (Extended Abstract). AMAST 1991: 303-326 - 1990
- [j10]Roland Carl Backhouse, Grant Malcolm:
On induced congruences. Bull. EATCS 40: 201-206 (1990)
1980 – 1989
- 1989
- [j9]Roland Carl Backhouse
Do-It-Yourself Type Theory. Formal Aspects Comput. 1(1): 19-84 (1989) - 1987
- [j8]Roland Carl Backhouse
A While-Rule in Martin-Löf's Theory of Types. Comput. J. 30(1): 27-36 (1987) - 1986
- [b3]Roland Carl Backhouse:
Program construction and verification. PHI Series in computer science, Prentice Hall 1986, ISBN 978-0-13-729146-5, pp. I-XI, 1-281 - 1984
- [j7]Roland Carl Backhouse
Global Data Flow Analysis Problems Arising in Locally Least-Cost Error Recovery. ACM Trans. Program. Lang. Syst. 6(2): 192-214 (1984) - 1983
- [j6]Stuart Oliver Anderson, Roland Carl Backhouse, E. H. Bugge, C. P. Stirling:
An Assessment of Locally Least-Cost Error Recovery. Comput. J. 26(1): 15-24 (1983) - 1982
- [j5]Stuart Oliver Anderson, Roland Carl Backhouse:
An Alternative Implementation of an Insertion-Only Recovery Technique. Acta Informatica 18: 289-298 (1982) - [j4]Roland Carl Backhouse:
Writing a Number as a Sum of Two Squares: A New Solution. Inf. Process. Lett. 14(1): 15-17 (1982) - 1981
- [j3]Stuart Oliver Anderson, Roland Carl Backhouse:
Locally Least-Cost Error Recovery in Early's Algorithm. ACM Trans. Program. Lang. Syst. 3(3): 318-347 (1981)
1970 – 1979
- 1979
- [b2]Roland Carl Backhouse:
Syntax of Programming Languages: Theory and Practice. Prentice-Hall 1979, ISBN 0-13-879999-7 - [j2]Roland Carl Backhouse, Stuart Oliver Anderson:
Least-cost repair of syntax errors. ACM SIGPLAN Notices 14(1): 102-104 (1979) - 1977
- [c1]Roland Carl Backhouse
Factor Graphs, Failure Functions and BI-Trees. ICALP 1977: 61-75 - 1976
- [b1]Roland Carl Backhouse:
Closure algorithms and the star-height problem of regular languages. Imperial College London, UK, 1976 - [j1]Roland Carl Backhouse:
An Alternative Approach to the Improvement of LR(k) Parsers. Acta Informatica 6: 277-296 (1976)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:59 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: