The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Roland Carl Backhouse: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Roland Carl Backhouse
    Pair algebras and Galois connections. [Citation Graph (0, 0)][DBLP]
    RelMiCS, 1998, pp:8-12 [Conf]
  2. Roland Carl Backhouse, Diethard Michaelis
    Fixed-Point Characterisation of Winning Strategies in Impartial Games. [Citation Graph (0, 0)][DBLP]
    RelMiCS, 2003, pp:34-47 [Conf]
  3. Roland Carl Backhouse, Paul F. Hoogendijk
    Generic Properties of Datatypes. [Citation Graph (0, 0)][DBLP]
    Generic Programming, 2003, pp:97-132 [Conf]
  4. Roland Carl Backhouse
    Galois Connections and Fixed Point Calculus. [Citation Graph (0, 0)][DBLP]
    Algebraic and Coalgebraic Methods in the Mathematics of Program Construction, 2000, pp:89-148 [Conf]
  5. Henk Doornbos, Roland Carl Backhouse
    Algebra of Program Termination. [Citation Graph (0, 0)][DBLP]
    Algebraic and Coalgebraic Methods in the Mathematics of Program Construction, 2000, pp:203-236 [Conf]
  6. Roland Carl Backhouse, Patrik Jansson, Johan Jeuring, Lambert G. L. T. Meertens
    Generic Programming: An Introduction. [Citation Graph (0, 0)][DBLP]
    Advanced Functional Programming, 1998, pp:28-115 [Conf]
  7. Matteo Vaccari, Roland Carl Backhouse
    Deriving a systolic regular language recognizer. [Citation Graph (0, 0)][DBLP]
    Algorithmic Languages and Calculi, 1997, pp:49-72 [Conf]
  8. Roland Carl Backhouse
    Algebraic Approaches to Problem Generalisation. [Citation Graph (0, 0)][DBLP]
    AMAST, 2004, pp:1-2 [Conf]
  9. Roland Carl Backhouse, Peter J. de Bruin, Paul F. Hoogendijk, Grant Malcolm, Ed Voermans, Jaap van der Woude
    Polynomial Relators (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    AMAST, 1991, pp:303-326 [Conf]
  10. Roland Carl Backhouse
    Datatype-Generic Reasoning. [Citation Graph (0, 0)][DBLP]
    CiE, 2006, pp:21-34 [Conf]
  11. Roland Carl Backhouse, Marcel Bijsterveld, Rik van Geldrop, Jaap van der Woude
    Categorical Fixed Point Calculus. [Citation Graph (0, 0)][DBLP]
    Category Theory and Computer Science, 1995, pp:159-179 [Conf]
  12. Paul F. Hoogendijk, Roland Carl Backhouse
    When Do Datatypes Commute? [Citation Graph (0, 0)][DBLP]
    Category Theory and Computer Science, 1997, pp:242-260 [Conf]
  13. Roland Carl Backhouse
    Fusion on Languages. [Citation Graph (0, 0)][DBLP]
    ESOP, 2001, pp:107-121 [Conf]
  14. Richard Verhoeven, Roland Carl Backhouse
    Interfacing Program Construction and Verification. [Citation Graph (0, 0)][DBLP]
    World Congress on Formal Methods, 1999, pp:1128-1146 [Conf]
  15. Roland Carl Backhouse, R. K. Lutz
    Factor Graphs, Failure Functions and BI-Trees. [Citation Graph (0, 0)][DBLP]
    ICALP, 1977, pp:61-75 [Conf]
  16. Roland Carl Backhouse, Paul F. Hoogendijk
    Elements of a Relational Theory of Datatypes. [Citation Graph (0, 0)][DBLP]
    Formal Program Development, 1993, pp:7-42 [Conf]
  17. Kevin Backhouse, Roland Carl Backhouse
    Logical Relations and Galois Connections. [Citation Graph (0, 0)][DBLP]
    MPC, 2002, pp:23-39 [Conf]
  18. Roland Carl Backhouse, A. J. M. van Gasteren
    Calculating a Path Algorithm. [Citation Graph (0, 0)][DBLP]
    MPC, 1992, pp:32-44 [Conf]
  19. Roland Carl Backhouse, Diethard Michaelis
    Exercises in Quantifier Manipulation. [Citation Graph (0, 0)][DBLP]
    MPC, 2006, pp:69-81 [Conf]
  20. Henk Doornbos, Roland Carl Backhouse
    Induction and Recursion on Datatypes. [Citation Graph (0, 0)][DBLP]
    MPC, 1995, pp:242-256 [Conf]
  21. Matteo Vaccari, Roland Carl Backhouse
    Calculating a Round-Robin Scheduler. [Citation Graph (0, 0)][DBLP]
    MPC, 1998, pp:365-382 [Conf]
  22. S. O. Anderson, Roland Carl Backhouse
    An Alternative Implementation of an Insertion-Only Recovery Technique. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1982, v:18, n:, pp:289-298 [Journal]
  23. Roland Carl Backhouse
    An Alternative Approach to the Improvement of LR(k) Parsers. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1976, v:6, n:, pp:277-296 [Journal]
  24. Roland Carl Backhouse, A. Khamiss
    A While-Rule in Martin-Löf's Theory of Types. [Citation Graph (0, 0)][DBLP]
    Comput. J., 1987, v:30, n:1, pp:27-36 [Journal]
  25. S. O. Anderson, Roland Carl Backhouse, E. H. Bugge, C. P. Stirling
    An Assessment of Locally Least-Cost Error Recovery. [Citation Graph (0, 0)][DBLP]
    Comput. J., 1983, v:26, n:1, pp:15-24 [Journal]
  26. Roland Carl Backhouse, Grant Malcolm
    On induced congruences. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 1990, v:40, n:, pp:201-206 [Journal]
  27. Roland Carl Backhouse, Paul Chisholm
    Do-It-Yourself Type Theory. [Citation Graph (0, 0)][DBLP]
    Formal Asp. Comput., 1989, v:1, n:1, pp:19-84 [Journal]
  28. Roland Carl Backhouse
    Writing a Number as a Sum of Two Squares: A New Solution. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1982, v:14, n:1, pp:15-17 [Journal]
  29. Roland Carl Backhouse
    Pair Algebras and Galois Connections. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1998, v:67, n:4, pp:169-175 [Journal]
  30. Roland Carl Backhouse, Maarten M. Fokkinga
    The associativity of equivalence and the Towers of Hanoi problem. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2001, v:77, n:2-4, pp:71-76 [Journal]
  31. 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. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1995, v:53, n:3, pp:131-136 [Journal]
  32. Roland Carl Backhouse, Paul F. Hoogendijk
    Final dialgebras: From categories to allegories. [Citation Graph (0, 0)][DBLP]
    ITA, 1999, v:33, n:4/5, pp:401-426 [Journal]
  33. Roland Carl Backhouse
    Regular algebra applied to language problems. [Citation Graph (0, 0)][DBLP]
    J. Log. Algebr. Program., 2006, v:66, n:2, pp:71-111 [Journal]
  34. Roland Carl Backhouse, Jaap van der Woude
    Demonic Operators and Monotype Factors. [Citation Graph (0, 0)][DBLP]
    Mathematical Structures in Computer Science, 1993, v:3, n:4, pp:417-433 [Journal]
  35. Roland Carl Backhouse
    Mathematics of Program Construction. [Citation Graph (0, 0)][DBLP]
    Sci. Comput. Program., 1996, v:26, n:1-3, pp:5-9 [Journal]
  36. Kevin Backhouse, Roland Carl Backhouse
    Safety of abstract interpretations for free, via logical relations and Galois connections. [Citation Graph (0, 0)][DBLP]
    Sci. Comput. Program., 2004, v:51, n:1-2, pp:153-196 [Journal]
  37. Roland Carl Backhouse, J. P. H. W. van den Eijnde, A. J. M. van Gasteren
    Calculating Path Algorithms. [Citation Graph (0, 0)][DBLP]
    Sci. Comput. Program., 1994, v:22, n:1-2, pp:3-19 [Journal]
  38. Henk Doornbos, Roland Carl Backhouse
    Reductivity. [Citation Graph (0, 0)][DBLP]
    Sci. Comput. Program., 1996, v:26, n:1-3, pp:217-236 [Journal]
  39. Paul F. Hoogendijk, Roland Carl Backhouse
    Relational Programming Laws in the Tree, List, Bag, Set Hierarchy. [Citation Graph (0, 0)][DBLP]
    Sci. Comput. Program., 1994, v:22, n:1-2, pp:67-105 [Journal]
  40. Roland Carl Backhouse, Richard Verhoeven, Olaf Weber
    Math/pad: A System for On-Line Preparation of Mathematical Documents. [Citation Graph (0, 0)][DBLP]
    Software - Concepts and Tools, 1997, v:18, n:2, pp:80-0 [Journal]
  41. Henk Doornbos, Roland Carl Backhouse, Jaap van der Woude
    A Calculational Approach to Mathematical Induction. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1997, v:179, n:1-2, pp:103-135 [Journal]
  42. S. O. Anderson, Roland Carl Backhouse
    Locally Least-Cost Error Recovery in Early's Algorithm. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Program. Lang. Syst., 1981, v:3, n:3, pp:318-347 [Journal]
  43. Roland Carl Backhouse
    Global Data Flow Analysis Problems Arising in Locally Least-Cost Error Recovery. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Program. Lang. Syst., 1984, v:6, n:2, pp:192-214 [Journal]

  44. Type-theoretic design patterns. [Citation Graph (, )][DBLP]


  45. Recounting the Rationals: Twice!. [Citation Graph (, )][DBLP]


  46. The Capacity-CTorch Problem. [Citation Graph (, )][DBLP]


  47. The Algorithmics of Solitaire-Like Games. [Citation Graph (, )][DBLP]


  48. Which Mathematics for the Information Society? [Citation Graph (, )][DBLP]


Search in 0.006secs, Finished in 0.008secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002