Roland Carl Backhouse - researchr alias

researchr

You are not signed in
Sign in
Sign up

2011

On Euclid s algorithm and elementary number theoryRoland Carl Backhouse, João F. Ferreira. SCP, 76(3):160-180, 2011. [doi]

2010

The Algorithmics of Solitaire-Like GamesRoland Carl Backhouse, Wei Chen, João F. Ferreira. mpc 2010: 1-18 [doi]

2009

Which Mathematics for the Information Society?JoÃ£o F. Ferreira, Alexandra Mendes, Roland Carl Backhouse, LuÃs S. Barbosa. tfm 2009: 39-56 [doi]

2008

Recounting the Rationals: Twice!Roland Carl Backhouse, João F. Ferreira. mpc 2008: 79-91 [doi]

The Capacity-CTorch ProblemRoland Carl Backhouse. mpc 2008: 57-78 [doi]

Datatype-Generic Termination ProofsRoland Carl Backhouse, Henk Doornbos. mst, 43(3-4):362-393, 2008. [doi]

2006

Datatype-Generic ReasoningRoland Carl Backhouse. cie 2006: 21-34 [doi]

Exercises in Quantifier ManipulationRoland Carl Backhouse, Diethard Michaelis. mpc 2006: 69-81 [doi]

Regular algebra applied to language problemsRoland Carl Backhouse. jlp, 66(2):71-111, 2006. [doi]

Type-theoretic design patternsOndrej Rypacek, Roland Carl Backhouse, Henrik Nilsson. ICFP 2006: 13-22 [doi]

2004

Safety of abstract interpretations for free, via logical relations and Galois connectionsKevin Backhouse, Roland Carl Backhouse. SCP, 51(1-2):153-196, 2004. [doi]

Algebraic Approaches to Problem GeneralisationRoland Carl Backhouse. amast 2004: 1-2 [doi]

2003

Generic Properties of DatatypesRoland Carl Backhouse, Paul F. Hoogendijk. ac 2003: 97-132 [doi]

Fixed-Point Characterisation of Winning Strategies in Impartial GamesRoland Carl Backhouse, Diethard Michaelis. RelMiCS 2004: 34-47 [doi]

Generic Programming - Advanced LecturesRoland Carl Backhouse, Jeremy Gibbons, editors, Volume 2793 of Lecture Notes in Computer Science, Springer, 2003.

2002

Logical Relations and Galois ConnectionsKevin Backhouse, Roland Carl Backhouse. mpc 2002: 23-39 [doi]

Algebraic and Coalgebraic Methods in the Mathematics of Program Construction, International Summer School and Workshop, Oxford, UK, April 10-14, 2000, Revised LecturesRoland Carl Backhouse, Roy L. Crole, Jeremy Gibbons, editors, Volume 2297 of Lecture Notes in Computer Science, Springer, 2002.

2001

Fusion on LanguagesRoland Carl Backhouse. ESOP 2001: 107-121 [doi]

The associativity of equivalence and the Towers of Hanoi problemRoland Carl Backhouse, Maarten M. Fokkinga. ipl, 77(2-4):71-76, 2001. [doi]

2000

Galois Connections and Fixed Point CalculusRoland Carl Backhouse. acmmpc 2002: 89-148 [doi]

Mathematics of Program Construction, 5th International Conference, MPC 2000, Ponte de Lima, Portugal, July 3-5, 2000, ProceedingsRoland Carl Backhouse, José Nuno Oliveira, editors, Volume 1837 of Lecture Notes in Computer Science, Springer, 2000.

Algebra of Program TerminationHenk Doornbos, Roland Carl Backhouse. acmmpc 2002: 203-236 [doi]

1999

Final dialgebras: From categories to allegoriesRoland Carl Backhouse, Paul F. Hoogendijk. ita, 33(4/5):401-426, 1999.

Interfacing Program Construction and VerificationRichard Verhoeven, Roland Carl Backhouse. fm 1999: 1128-1146 [doi]

1998

Pair Algebras and Galois ConnectionsRoland Carl Backhouse. ipl, 67(4):169-175, 1998. [doi]

Pair algebras and Galois connectionsRoland Carl Backhouse. RelMiCS 1998: 8-12

Generic Programming: An IntroductionRoland Carl Backhouse, Patrik Jansson, Johan Jeuring, Lambert G. L. T. Meertens. afp 1998: 28-115

Calculating a Round-Robin SchedulerMatteo Vaccari, Roland Carl Backhouse. mpc 1998: 365-382 [doi]

1997

Math/pad: A System for On-Line Preparation of Mathematical DocumentsRoland Carl Backhouse, Richard Verhoeven, Olaf Weber. stp, 18(2):80, 1997.

A Calculational Approach to Mathematical InductionHenk Doornbos, Roland Carl Backhouse, Jaap van der Woude. TCS, 179(1-2):103-135, 1997. [doi]

When Do Datatypes Commute?Paul F. Hoogendijk, Roland Carl Backhouse. ctcs 1997: 242-260

Deriving a systolic regular language recognizerMatteo Vaccari, Roland Carl Backhouse. alc 1997: 49-72

1996

Mathematics of Program ConstructionRoland Carl Backhouse. SCP, 26(1-3):5-9, 1996.

ReductivityHenk Doornbos, Roland Carl Backhouse. SCP, 26(1-3):217-236, 1996.

1995

1994

Calculating Path AlgorithmsRoland Carl Backhouse, J. P. H. W. van den Eijnde, A. J. M. van Gasteren. SCP, 22(1-2):3-19, 1994.

Relational Programming Laws in the Tree, List, Bag, Set HierarchyPaul F. Hoogendijk, Roland Carl Backhouse. SCP, 22(1-2):67-105, 1994.

1993

Elements of a Relational Theory of DatatypesRoland Carl Backhouse, Paul F. Hoogendijk. ifip2-1 1993: 7-42

Demonic Operators and Monotype FactorsRoland Carl Backhouse, Jaap van der Woude. mscs, 3(4):417-433, 1993.

1992

Calculating a Path AlgorithmRoland Carl Backhouse, A. J. M. van Gasteren. mpc 1993: 32-44

1991

Polynomial Relators (Extended Abstract)Roland Carl Backhouse, Peter J. de Bruin, Paul F. Hoogendijk, Grant Malcolm, Ed Voermans, Jaap van der Woude. amast 1992: 303-326

1990

On induced congruencesRoland Carl Backhouse, Grant Malcolm. eatcs, 40:201-206, 1990.

1989

Do-It-Yourself Type TheoryRoland Carl Backhouse, Paul Chisholm. fac, 1(1):19-84, 1989.

1987

A While-Rule in Martin-Löf s Theory of TypesRoland Carl Backhouse, A. Khamiss. cj, 30(1):27-36, 1987.

1986

Program construction and verificationRoland Carl Backhouse. PHI Series in computer science, Prentice Hall, 1986.

1984

Global Data Flow Analysis Problems Arising in Locally Least-Cost Error RecoveryRoland Carl Backhouse. TOPLAS, 6(2):192-214, 1984. [doi]

1983

An Assessment of Locally Least-Cost Error RecoveryS. O. Anderson, Roland Carl Backhouse, E. H. Bugge, C. P. Stirling. cj, 26(1):15-24, 1983.

1982

An Alternative Implementation of an Insertion-Only Recovery TechniqueS. O. Anderson, Roland Carl Backhouse. ACTA, 18:289-298, 1982.

Writing a Number as a Sum of Two Squares: A New SolutionRoland Carl Backhouse. ipl, 14(1):15-17, 1982.

1981

Locally Least-Cost Error Recovery in Early s AlgorithmS. O. Anderson, Roland Carl Backhouse. TOPLAS, 3(3):318-347, 1981. [doi]

1979

Syntax of Programming Languages: Theory and PracticeRoland Carl Backhouse. Prentice-Hall, 1979.

1977

Factor Graphs, Failure Functions and BI-TreesRoland Carl Backhouse, R. K. Lutz. icalp 1977: 61-75

1976

An Alternative Approach to the Improvement of ::::LR(k):::: ParsersRoland Carl Backhouse. ACTA, 6:277-296, 1976.