![]() | ![]() |
| 2011 | ||
|---|---|---|
| 55 | Roland Carl Backhouse, João F. Ferreira: On Euclid's algorithm and elementary number theory. Sci. Comput. Program. 76(3): 160-180 (2011) | |
| 2010 | ||
| 54 | Roland Carl Backhouse, Wei Chen, João F. Ferreira: The Algorithmics of Solitaire-Like Games. MPC 2010: 1-18 | |
| 2009 | ||
| 53 | João F. Ferreira, Alexandra Mendes, Roland Carl Backhouse, Luís Soares Barbosa: Which Mathematics for the Information Society? TFM 2009: 39-56 | |
| 2008 | ||
| 52 | Roland Carl Backhouse: The Capacity-CTorch Problem. MPC 2008: 57-78 | |
| 51 | Roland Carl Backhouse, João F. Ferreira: Recounting the Rationals: Twice!. MPC 2008: 79-91 | |
| 50 | Roland Carl Backhouse, Henk Doornbos: Datatype-Generic Termination Proofs. Theory Comput. Syst. 43(3-4): 362-393 (2008) | |
| 2006 | ||
| 49 | Roland Carl Backhouse: Datatype-Generic Reasoning. CiE 2006: 21-34 | |
| 48 | Ondrej Rypacek, Roland Carl Backhouse, Henrik Nilsson: Type-theoretic design patterns. ICFP-WGP 2006: 13-22 | |
| 47 | Roland Carl Backhouse, Diethard Michaelis: Exercises in Quantifier Manipulation. MPC 2006: 69-81 | |
| 46 | Roland Carl Backhouse: Regular algebra applied to language problems. J. Log. Algebr. Program. 66(2): 71-111 (2006) | |
| 2004 | ||
| 45 | Roland Carl Backhouse: Algebraic Approaches to Problem Generalisation. AMAST 2004: 1-2 | |
| 44 | 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) | |
| 2003 | ||
| 43 | Roland Carl Backhouse, Jeremy Gibbons: Generic Programming - Advanced Lectures Springer 2003 | |
| 42 | Roland Carl Backhouse, Paul F. Hoogendijk: Generic Properties of Datatypes. Generic Programming 2003: 97-132 | |
| 41 | Roland Carl Backhouse, Diethard Michaelis: Fixed-Point Characterisation of Winning Strategies in Impartial Games. RelMiCS 2003: 34-47 | |
| 2002 | ||
| 40 | 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 Springer 2002 | |
| 39 | Kevin Backhouse, Roland Carl Backhouse: Logical Relations and Galois Connections. MPC 2002: 23-39 | |
| 2001 | ||
| 38 | Roland Carl Backhouse: Fusion on Languages. ESOP 2001: 107-121 | |
| 37 | Roland Carl Backhouse, Maarten M. Fokkinga: The associativity of equivalence and the Towers of Hanoi problem. Inf. Process. Lett. 77(2-4): 71-76 (2001) | |
| 2000 | ||
| 36 | Roland Carl Backhouse, José Nuno Oliveira: Mathematics of Program Construction, 5th International Conference, MPC 2000, Ponte de Lima, Portugal, July 3-5, 2000, Proceedings Springer 2000 | |
| 35 | Henk Doornbos, Roland Carl Backhouse: Algebra of Program Termination. Algebraic and Coalgebraic Methods in the Mathematics of Program Construction 2000: 203-236 | |
| 34 | Roland Carl Backhouse: Galois Connections and Fixed Point Calculus. Algebraic and Coalgebraic Methods in the Mathematics of Program Construction 2000: 89-148 | |
| 1999 | ||
| 33 | Richard Verhoeven, Roland Carl Backhouse: Interfacing Program Construction and Verification. World Congress on Formal Methods 1999: 1128-1146 | |
| 32 | Roland Carl Backhouse, Paul F. Hoogendijk: Final dialgebras: From categories to allegories. ITA 33(4/5): 401-426 (1999) | |
| 1998 | ||
| 31 | Roland Carl Backhouse, Patrik Jansson, Johan Jeuring, Lambert G. L. T. Meertens: Generic Programming: An Introduction. Advanced Functional Programming 1998: 28-115 | |
| 30 | Matteo Vaccari, Roland Carl Backhouse: Calculating a Round-Robin Scheduler. MPC 1998: 365-382 | |
| 29 | Roland Carl Backhouse: Pair algebras and Galois connections. RelMiCS 1998: 8-12 | |
| 28 | Roland Carl Backhouse: Pair Algebras and Galois Connections. Inf. Process. Lett. 67(4): 169-175 (1998) | |
| 1997 | ||
| 27 | Matteo Vaccari, Roland Carl Backhouse: Deriving a systolic regular language recognizer. Algorithmic Languages and Calculi 1997: 49-72 | |
| 26 | Paul F. Hoogendijk, Roland Carl Backhouse: When Do Datatypes Commute? Category Theory and Computer Science 1997: 242-260 | |
| 25 | Roland Carl Backhouse, Richard Verhoeven, Olaf Weber: Math/pad: A System for On-Line Preparation of Mathematical Documents. Software - Concepts and Tools 18(2): 80- (1997) | |
| 24 | Henk Doornbos, Roland Carl Backhouse, Jaap van der Woude: A Calculational Approach to Mathematical Induction. Theor. Comput. Sci. 179(1-2): 103-135 (1997) | |
| 1996 | ||
| 23 | Henk Doornbos, Roland Carl Backhouse: Reductivity. Sci. Comput. Program. 26(1-3): 217-236 (1996) | |
| 22 | Roland Carl Backhouse: Mathematics of Program Construction. Sci. Comput. Program. 26(1-3): 5-9 (1996) | |
| 1995 | ||
| 21 | Roland Carl Backhouse, Marcel Bijsterveld, Rik van Geldrop, Jaap van der Woude: Categorical Fixed Point Calculus. Category Theory and Computer Science 1995: 159-179 | |
| 20 | Henk Doornbos, Roland Carl Backhouse: Induction and Recursion on Datatypes. MPC 1995: 242-256 | |
| 19 | 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) | |
| 1994 | ||
| 18 | Roland Carl Backhouse, J. P. H. W. van den Eijnde, A. J. M. van Gasteren: Calculating Path Algorithms. Sci. Comput. Program. 22(1-2): 3-19 (1994) | |
| 17 | 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 | ||
| 16 | Roland Carl Backhouse, Paul F. Hoogendijk: Elements of a Relational Theory of Datatypes. Formal Program Development 1993: 7-42 | |
| 15 | Roland Carl Backhouse, Jaap van der Woude: Demonic Operators and Monotype Factors. Mathematical Structures in Computer Science 3(4): 417-433 (1993) | |
| 1992 | ||
| 14 | Roland Carl Backhouse, A. J. M. van Gasteren: Calculating a Path Algorithm. MPC 1992: 32-44 | |
| 1991 | ||
| 13 | 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 | ||
| 12 | Roland Carl Backhouse, Grant Malcolm: On induced congruences. Bulletin of the EATCS 40: 201-206 (1990) | |
| 1989 | ||
| 11 | Roland Carl Backhouse, Paul Chisholm: Do-It-Yourself Type Theory. Formal Asp. Comput. 1(1): 19-84 (1989) | |
| 1987 | ||
| 10 | Roland Carl Backhouse, A. Khamiss: A While-Rule in Martin-Löf's Theory of Types. Comput. J. 30(1): 27-36 (1987) | |
| 1986 | ||
| 9 | Roland Carl Backhouse: Program construction and verification. Prentice Hall 1986: I-XI, 1-281 | |
| 1984 | ||
| 8 | 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 | ||
| 7 | S. O. 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 | ||
| 6 | S. O. Anderson, Roland Carl Backhouse: An Alternative Implementation of an Insertion-Only Recovery Technique. Acta Inf. 18: 289-298 (1982) | |
| 5 | Roland Carl Backhouse: Writing a Number as a Sum of Two Squares: A New Solution. Inf. Process. Lett. 14(1): 15-17 (1982) | |
| 1981 | ||
| 4 | S. O. Anderson, Roland Carl Backhouse: Locally Least-Cost Error Recovery in Early's Algorithm. ACM Trans. Program. Lang. Syst. 3(3): 318-347 (1981) | |
| 1979 | ||
| 3 | Roland Carl Backhouse: Syntax of Programming Languages: Theory and Practice Prentice-Hall 1979 | |
| 1977 | ||
| 2 | Roland Carl Backhouse, R. K. Lutz: Factor Graphs, Failure Functions and BI-Trees. ICALP 1977: 61-75 | |
| 1976 | ||
| 1 | Roland Carl Backhouse: An Alternative Approach to the Improvement of LR(k) Parsers. Acta Inf. 6: 277-296 (1976) | |
Colors in the list of coauthors
Last update Sun May 27 04:04:01 2012 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page