Roland Carl Backhouse

According to our database1, Roland Carl Backhouse
  • authored at least 61 papers between 1976 and 2016.
  • has a "Dijkstra number"2 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2016
Factor theory and the unity of opposites.
J. Log. Algebr. Meth. Program., 2016

2015
The capacity-C torch problem.
Sci. Comput. Program., 2015

On Euclid's Algorithm and Elementary Number Theory.
CoRR, 2015

2014
First-past-the-post games.
Sci. Comput. Program., 2014

Structure Editing of Handwritten Mathematics: Improving the Computer Support for the Calculational Method.
Proceedings of the Ninth ACM International Conference on Interactive Tabletops and Surfaces, 2014

2013
The algorithmics of solitaire-like games.
Sci. Comput. Program., 2013

2012
First-Past-the-Post Games.
Proceedings of the Mathematics of Program Construction - 11th International Conference, 2012

2011
On Euclid's algorithm and elementary number theory.
Sci. Comput. Program., 2011

2010
The Algorithmics of Solitaire-Like Games.
Proceedings of the Mathematics of Program Construction, 10th International Conference, 2010

2009
Which Mathematics for the Information Society?
Proceedings of the Teaching Formal Methods, Second International Conference, 2009

Meeting a fanclub: a lattice of generic shape selectors.
Proceedings of the 2009 ACM SIGPLAN workshop on Generic programming, 2009

2008
Datatype-Generic Termination Proofs.
Theory Comput. Syst., 2008

Recounting the Rationals: Twice!.
Proceedings of the Mathematics of Program Construction, 9th International Conference, 2008

The Capacity-CTorch Problem.
Proceedings of the Mathematics of Program Construction, 9th International Conference, 2008

2006
Regular algebra applied to language problems.
J. Log. Algebr. Program., 2006

Exercises in Quantifier Manipulation.
Proceedings of the Mathematics of Program Construction, 8th International Conference, 2006

Type-theoretic design patterns.
Proceedings of the ACM SIGPLAN Workshop on Generic Programming, 2006

Datatype-Generic Reasoning.
Proceedings of the Logical Approaches to Computational Barriers, 2006

2004
Safety of abstract interpretations for free, via logical relations and Galois connections.
Sci. Comput. Program., 2004

Algebraic Approaches to Problem Generalisation.
Proceedings of the Algebraic Methodology and Software Technology, 2004

2003
Generic Properties of Datatypes.
Proceedings of the Generic Programming - Advanced Lectures, 2003

Fixed-Point Characterisation of Winning Strategies in Impartial Games.
Proceedings of the Relational and Kleene-Algebraic Methods in Computer Science: 7th International Seminar on Relational Methods in Computer Science and 2nd International Workshop on Applications of Kleene Algebra, 2003

2002
Logical Relations and Galois Connections.
Proceedings of the Mathematics of Program Construction, 6th International Conference, 2002

2001
The associativity of equivalence and the Towers of Hanoi problem.
Inf. Process. Lett., 2001

Fusion on Languages.
Proceedings of the Programming Languages and Systems, 2001

2000
Algebra of Program Termination.
Proceedings of the Algebraic and Coalgebraic Methods in the Mathematics of Program Construction, 2000

Galois Connections and Fixed Point Calculus.
Proceedings of the Algebraic and Coalgebraic Methods in the Mathematics of Program Construction, 2000

1999
Final dialgebras: From categories to allegories.
ITA, 1999

Interfacing Program Construction and Verification.
Proceedings of the FM'99 - Formal Methods, 1999

1998
Pair Algebras and Galois Connections.
Inf. Process. Lett., 1998

Calculating a Round-Robin Scheduler.
Proceedings of the Mathematics of Program Construction, 1998

Generic Programming: An Introduction.
Proceedings of the Advanced Functional Programming, 1998

Pair algebras and Galois connections.
Proceedings of the Participants Copies for Relational Methods in Logic, 1998

1997
A Calculational Approach to Mathematical Induction.
Theor. Comput. Sci., 1997

Math/pad: A System for On-Line Preparation of Mathematical Documents.
Software - Concepts and Tools, 1997

When Do Datatypes Commute?
Proceedings of the Category Theory and Computer Science, 7th International Conference, 1997

Deriving a systolic regular language recognizer.
Proceedings of the Algorithmic Languages and Calculi, 1997

1996
Reductivity.
Sci. Comput. Program., 1996

Mathematics of Program Construction.
Sci. Comput. Program., 1996

1995
Fixed-Point Calculus.
Inf. Process. Lett., 1995

Induction and Recursion on Datatypes.
Proceedings of the Mathematics of Program Construction, 1995

Categorical Fixed Point Calculus.
Proceedings of the Category Theory and Computer Science, 6th International Conference, 1995

1994
Relational Programming Laws in the Tree, List, Bag, Set Hierarchy.
Sci. Comput. Program., 1994

Calculating Path Algorithms.
Sci. Comput. Program., 1994

1993
Demonic Operators and Monotype Factors.
Mathematical Structures in Computer Science, 1993

Elements of a Relational Theory of Datatypes.
Proceedings of the Formal Program Development - IFIP TC2/WG 2.1 State-of-the-Art Report, 1993

1992
Calculating a Path Algorithm.
Proceedings of the Mathematics of Program Construction, Second International Conference, Oxford, U.K., June 29, 1992

1991
Polynomial Relators (Extended Abstract).
Proceedings of the Algebraic Methodology and Software Technology (AMAST '91), 1991

1990
On induced congruences.
Bulletin of the EATCS, 1990

1989
Do-It-Yourself Type Theory.
Formal Asp. Comput., 1989

1987
A While-Rule in Martin-Löf's Theory of Types.
Comput. J., 1987

1986
Program construction and verification.
PHI Series in computer science, Prentice Hall, ISBN: 978-0-13-729146-5, 1986

1984
Global Data Flow Analysis Problems Arising in Locally Least-Cost Error Recovery.
ACM Trans. Program. Lang. Syst., 1984

1983
An Assessment of Locally Least-Cost Error Recovery.
Comput. J., 1983

1982
Writing a Number as a Sum of Two Squares: A New Solution.
Inf. Process. Lett., 1982

An Alternative Implementation of an Insertion-Only Recovery Technique.
Acta Inf., 1982

1981
Locally Least-Cost Error Recovery in Early's Algorithm.
ACM Trans. Program. Lang. Syst., 1981

1979
Syntax of Programming Languages: Theory and Practice
Prentice-Hall, ISBN: 0-13-879999-7, 1979

1977
Factor Graphs, Failure Functions and BI-Trees.
Proceedings of the Automata, 1977

1976
Closure algorithms and the star-height problem of regular languages.
PhD thesis, 1976

An Alternative Approach to the Improvement of LR(k) Parsers.
Acta Inf., 1976


  Loading...