Roland Carl Backhouse

76 papers A* 1A 1B 12C 1Journal 38Unranked 16

Year	Rank	Type	Title / Venue / Authors
2024	J	`jnl`	An example of goal-directed, calculational proof. J. Funct. Program. Roland Carl Backhouse, Walter Guttmann, Michael Winter
2024	J	`jnl`	Diagonals and Block-Ordered Relations. CoRR Roland Carl Backhouse, Ed Voermans
2024	J	`jnl`	The Index and Core of a Relation. With Applications to the Axiomatics of Relation Algebra. Fundam. Informaticae Roland Carl Backhouse, Ed Voermans
2024	J	`jnl`	The Thins Ordering on Relations. CoRR Ed Voermans, Jules Desharnais, Roland Carl Backhouse
2023	J	`jnl`	An example of goal-directed proof. CoRR Roland Carl Backhouse, Walter Guttmann, Michael Winter
2023	J	`jnl`	On difunctions. J. Log. Algebraic Methods Program. Roland Carl Backhouse, José Nuno Oliveira
2023	J	`jnl`	The Index and Core of a Relation. With Applications to the Axiomatics of Relation Algebra. CoRR Roland Carl Backhouse, Ed Voermans
2022	J	`jnl`	Components and acyclicity of graphs. An exercise in combining precision with concision. J. Log. Algebraic Methods Program. Roland Carl Backhouse, Henk Doornbos, Roland Glück, Jaap van der Woude
2019	B	`conf`	An Analysis of Repeated Graph Search. MPC Roland Carl Backhouse
2016	J	`jnl`	Factor theory and the unity of opposites. J. Log. Algebraic Methods Program. Roland Carl Backhouse
2015	J	`jnl`	On Euclid's Algorithm and Elementary Number Theory. CoRR Roland Carl Backhouse, João F. Ferreira
2015	J	`jnl`	The capacity-C torch problem. Sci. Comput. Program. Roland Carl Backhouse, Hai Truong
2014	J	`jnl`	First-past-the-post games. Sci. Comput. Program. Roland Carl Backhouse
2014	B	`conf`	Structure Editing of Handwritten Mathematics: Improving the Computer Support for the Calculational Method. ITS Alexandra Mendes, Roland Carl Backhouse, João F. Ferreira
2013	J	`jnl`	The algorithmics of solitaire-like games. Sci. Comput. Program. Roland Carl Backhouse, Wei Chen, João F. Ferreira
2012	B	`conf`	First-Past-the-Post Games. MPC Roland Carl Backhouse
2011	J	`jnl`	On Euclid's algorithm and elementary number theory. Sci. Comput. Program. Roland Carl Backhouse, João F. Ferreira
2010	B	`conf`	The Algorithmics of Solitaire-Like Games. MPC Roland Carl Backhouse, Wei Chen, João F. Ferreira
2009	—	`conf`	Meeting a fanclub: a lattice of generic shape selectors. WGP@ICFP Roland Carl Backhouse, Richard S. Bird, Paul F. Hoogendijk
2009	—	`conf`	Which Mathematics for the Information Society? TFM João F. Ferreira, Alexandra Mendes, Roland Carl Backhouse, Luís Soares Barbosa
2008	J	`jnl`	Datatype-Generic Termination Proofs. Theory Comput. Syst. Roland Carl Backhouse, Henk Doornbos
2008	B	`conf`	Recounting the Rationals: Twice!. MPC Roland Carl Backhouse, João F. Ferreira
2008	B	`conf`	The Capacity-CTorch Problem. MPC Roland Carl Backhouse
2007	—	`ed.`	Datatype-Generic Programming - International Spring School, SSDGP 2006, Nottingham, UK, April 24-27, 2006, Revised Lectures SSDGP Roland Carl Backhouse, Jeremy Gibbons, Ralf Hinze, Johan Jeuring
2006	C	`conf`	Datatype-Generic Reasoning. CiE Roland Carl Backhouse
2006	B	`conf`	Exercises in Quantifier Manipulation. MPC Roland Carl Backhouse, Diethard Michaelis
2006	J	`jnl`	Regular algebra applied to language problems. J. Log. Algebraic Methods Program. Roland Carl Backhouse
2006	—	`conf`	Type-theoretic design patterns. ICFP-WGP Ondrej Rypacek, Roland Carl Backhouse, Henrik Nilsson
2004	—	`conf`	Algebraic Approaches to Problem Generalisation. AMAST Roland Carl Backhouse
2004	J	`jnl`	Safety of abstract interpretations for free, via logical relations and Galois connections. Sci. Comput. Program. Kevin Backhouse, Roland Carl Backhouse
2003	—	`conf`	Fixed-Point Characterisation of Winning Strategies in Impartial Games. RelMiCS Roland Carl Backhouse, Diethard Michaelis
2003	—	`ed.`	Generic Programming - Advanced Lectures Generic Programming Roland Carl Backhouse, Jeremy Gibbons
2003	—	`conf`	Generic Properties of Datatypes. Generic Programming Roland Carl Backhouse, Paul F. Hoogendijk
2002	—	`ed.`	Algebraic and Coalgebraic Methods in the Mathematics of Program Construction, International Summer School and Workshop, Oxford, UK, April 10-14, 2000, Revised Lectures Algebraic and Coalgebraic Methods in the Mathematics of Program Construction Roland Carl Backhouse, Roy L. Crole, Jeremy Gibbons
2002	B	`conf`	Logical Relations and Galois Connections. MPC Kevin Backhouse, Roland Carl Backhouse
2001	A	`conf`	Fusion on Languages. ESOP Roland Carl Backhouse
2001	J	`jnl`	The associativity of equivalence and the Towers of Hanoi problem. Inf. Process. Lett. Roland Carl Backhouse, Maarten M. Fokkinga
2000	—	`conf`	Algebra of Program Termination. Algebraic and Coalgebraic Methods in the Mathematics of Program Construction Henk Doornbos, Roland Carl Backhouse
2000	—	`conf`	Galois Connections and Fixed Point Calculus. Algebraic and Coalgebraic Methods in the Mathematics of Program Construction Roland Carl Backhouse
2000	B	`ed.`	Mathematics of Program Construction, 5th International Conference, MPC 2000, Ponte de Lima, Portugal, July 3-5, 2000, Proceedings MPC Roland Carl Backhouse, José Nuno Oliveira
1999	J	`jnl`	Final dialgebras: From categories to allegories. RAIRO Theor. Informatics Appl. Roland Carl Backhouse, Paul F. Hoogendijk
1999	—	`conf`	Interfacing Program Construction and Verification. World Congress on Formal Methods Richard Verhoeven, Roland Carl Backhouse
1998	B	`conf`	Calculating a Round-Robin Scheduler. MPC Matteo Vaccari, Roland Carl Backhouse
1998	—	`conf`	Generic Programming: An Introduction. Advanced Functional Programming Roland Carl Backhouse, Patrik Jansson, Johan Jeuring, Lambert G. L. T. Meertens
1998	J	`jnl`	Pair Algebras and Galois Connections. Inf. Process. Lett. Roland Carl Backhouse
1998	—	`conf`	Pair algebras and Galois connections. RelMiCS Roland Carl Backhouse
1997	J	`jnl`	A Calculational Approach to Mathematical Induction. Theor. Comput. Sci. Henk Doornbos, Roland Carl Backhouse, Jaap van der Woude
1997	—	`conf`	Deriving a systolic regular language recognizer. Algorithmic Languages and Calculi Matteo Vaccari, Roland Carl Backhouse
1997	J	`jnl`	Math/pad: A System for On-Line Preparation of Mathematical Documents. Softw. Concepts Tools Roland Carl Backhouse, Richard Verhoeven, Olaf Weber
1997	—	`ch.`	Programs and Datatypes. Relational Methods in Computer Science Henk Doornbos, Netty van Gasteren, Roland Carl Backhouse
1997	—	`conf`	When Do Datatypes Commute? Category Theory and Computer Science Paul F. Hoogendijk, Roland Carl Backhouse
1996	J	`jnl`	Mathematics of Program Construction. Sci. Comput. Program. Roland Carl Backhouse
1996	J	`jnl`	Reductivity. Sci. Comput. Program. Henk Doornbos, Roland Carl Backhouse
1995	—	`conf`	Categorical Fixed Point Calculus. Category Theory and Computer Science Roland Carl Backhouse, Marcel Bijsterveld, Rik van Geldrop, Jaap van der Woude
1995	J	`jnl`	Fixed-Point Calculus. Inf. Process. Lett. 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
1995	B	`conf`	Induction and Recursion on Datatypes. MPC Henk Doornbos, Roland Carl Backhouse
1994	J	`jnl`	Calculating Path Algorithms. Sci. Comput. Program. Roland Carl Backhouse, J. P. H. W. van den Eijnde, A. J. M. van Gasteren
1994	J	`jnl`	Relational Programming Laws in the Tree, List, Bag, Set Hierarchy. Sci. Comput. Program. Paul F. Hoogendijk, Roland Carl Backhouse
1993	J	`jnl`	Demonic Operators and Monotype Factors. Math. Struct. Comput. Sci. Roland Carl Backhouse, Jaap van der Woude
1993	—	`conf`	Elements of a Relational Theory of Datatypes. Formal Program Development Roland Carl Backhouse, Paul F. Hoogendijk
1992	B	`conf`	Calculating a Path Algorithm. MPC Roland Carl Backhouse, A. J. M. van Gasteren
1991	—	`conf`	Polynomial Relators (Extended Abstract). AMAST Roland Carl Backhouse, Peter J. de Bruin, Paul F. Hoogendijk, Grant Malcolm, Ed Voermans, Jaap van der Woude
1990	J	`jnl`	On induced congruences. Bull. EATCS Roland Carl Backhouse, Grant Malcolm
1989	J	`jnl`	Do-It-Yourself Type Theory. Formal Aspects Comput. Roland Carl Backhouse, Paul Chisholm
1987	J	`jnl`	A While-Rule in Martin-Löf's Theory of Types. Comput. J. Roland Carl Backhouse, A. Khamiss
1986	—	`book`	Program construction and verification. Roland Carl Backhouse
1984	J	`jnl`	Global Data Flow Analysis Problems Arising in Locally Least-Cost Error Recovery. ACM Trans. Program. Lang. Syst. Roland Carl Backhouse
1983	J	`jnl`	An Assessment of Locally Least-Cost Error Recovery. Comput. J. Stuart Oliver Anderson, Roland Carl Backhouse, E. H. Bugge, C. P. Stirling
1982	J	`jnl`	An Alternative Implementation of an Insertion-Only Recovery Technique. Acta Informatica Stuart Oliver Anderson, Roland Carl Backhouse
1982	J	`jnl`	Writing a Number as a Sum of Two Squares: A New Solution. Inf. Process. Lett. Roland Carl Backhouse
1981	J	`jnl`	Locally Least-Cost Error Recovery in Early's Algorithm. ACM Trans. Program. Lang. Syst. Stuart Oliver Anderson, Roland Carl Backhouse
1979	J	`jnl`	Least-cost repair of syntax errors. ACM SIGPLAN Notices Roland Carl Backhouse, Stuart Oliver Anderson
1979	—	`book`	Syntax of Programming Languages: Theory and Practice Roland Carl Backhouse
1977	A*	`conf`	Factor Graphs, Failure Functions and BI-Trees. ICALP Roland Carl Backhouse, R. K. Lutz
1976	J	`jnl`	An Alternative Approach to the Improvement of Acta Informatica Roland Carl Backhouse
1976	—	`—`	Closure algorithms and the star-height problem of regular languages. Roland Carl Backhouse