Roland Carl Backhouse | Academic Influence

Roland Carl Backhouse's AcademicInfluence.com Rankings

Roland Carl Backhouse

Computer Science

#1254

World Rank

#1294

Historical Rank

Programming

#51

World Rank

#53

Historical Rank

computer-science Degrees

Roland Carl Backhouse

Mathematics

#4538

World Rank

#6428

Historical Rank

Measure Theory

#3696

World Rank

#4359

Historical Rank

mathematics Degrees

Download Badge

Computer Science
Mathematics

Roland Carl Backhouse's Degrees

PhD Computer Science University of Essex
Bachelors Mathematics University of Essex

Similar Degrees You Can Earn

Why Is Roland Carl Backhouse Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Roland Carl Backhouse is a British computer scientist and mathematician. , he is Emeritus Professor of Computing Science at the University of Nottingham. Early life and education Backhouse was born and raised in the Thorntree district of Middlesbrough, an industrial town in the north-east of England. In 1959, he won a place at the then all-male Acklam Hall Grammar School before going on to Churchill College, Cambridge, in 1966. His doctorate was completed under the supervision of Jim Cunningham at Imperial College London.

(See a Problem?)

Roland Carl Backhouse's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Regular Algebra Applied to Path-finding Problems (1975) (172)
Generic Programming: An Introduction (1998) (160)
Program construction and verification (1986) (131)
Algebraic and Coalgebraic Methods in the Mathematics of Program Construction (2000) (106)
A relational theory of datatypes (1992) (97)
Fixed-Point Calculus (1995) (81)
Elements of a Relational Theory of Datatypes (1993) (79)
Demonic operators and monotype factors (1993) (71)
Program Construction: Calculating Implementations from Specifications (2003) (69)
A Calculational Approach to Mathematical Induction (1997) (63)
An Exploration of the Bird-Meertens Formalism (1989) (59)
Syntax of Programming Languages: Theory and Practice (1979) (58)
Deriving a systolic regular language recognizer (1997) (53)
Galois Connections and Fixed Point Calculus (2000) (51)
Calculating a Round-Robin Scheduler (1998) (49)
Final dialgebras: From categories to allegories (1999) (39)
Mathematical induction made calculational (1994) (36)
Closure algorithms and the star-height problem of regular languages (1976) (35)
Safety of abstract interpretations for free, via logical relations and Galois connections (2004) (30)
Categorical Fixed Point Calculus (1995) (29)
Calculating Path Algorithms (1994) (27)
Do-it-yourself type theory (1989) (26)
Category theory as coherently constructive lattice theory : an illustration (1994) (25)
Exercises in Quantifier Manipulation (2006) (24)
Induction and Recursion on Datatypes (1995) (24)
When Do Datatypes Commute? (1997) (21)
Polynomial Relators (Extended Abstract) (1991) (21)
Locally Least-Cost Error Recovery in Earley's Algorithm (1981) (21)
The calculational method (1995) (20)
An Assessment of Locally Least-Cost Error Recovery (1983) (18)
Regular algebra applied to language problems (2006) (18)
Relational Programming Laws in the Tree, List, Bag, Set Hierarchy (1994) (17)
On Euclid's algorithm and elementary number theory (2011) (16)
Generic Programming: Advanced Lectures (2003) (14)
Which Mathematics for the Information Society? (2009) (13)
Algorithmic Problem Solving (2011) (13)
Math/pad: A System for On-Line Preparation of Mathematical Documents (1997) (12)
A Class of Commuting Relators (1992) (12)
Reductivity (1996) (11)
Structure Editing of Handwritten Mathematics: Improving the Computer Support for the Calculational Method (2014) (10)
The associativity of equivalence and the Towers of Hanoi problem (2001) (10)
Making Formality Work For Us (1989) (10)
Pair Algebras and Galois Connections (1998) (9)
Fixed-Point Characterisation of Winning Strategies in Impartial Games (2003) (9)
Factor Graphs, Failure Functions and BI-Trees (1977) (9)
Recounting the Rationals: Twice! (2008) (9)
Interfacing Program Construction and Verification (1999) (9)
Workshop on generic programming (1998) (8)
Calculating a Path Algorithm (1992) (8)
Generic Properties of Datatypes (2003) (8)
Constructive Type Theory—An Introduction (1989) (8)
Mathematics and Programming A Revolution in the Art of Eective Reasoning (2001) (7)
Fusion on Languages (2001) (7)
Interfacing high-level and assembly language with microcodes in 3-D image generation (1994) (6)
Programs and Datatypes (1997) (6)
The algorithmics of solitaire-like games (2010) (5)
On a relation on functions (1990) (5)
An alternative approach to the improvement of LR(k) parsers (1976) (5)
Mathematics of Recursive Program Construction (2001) (5)
Algorithmic problem solving: three years on (2006) (4)
Logical Relations and Galois Connections (2002) (4)
A While-Rule in Martin-Löf's Theory of Types (1987) (3)
Least-cost repair of syntax errors (1979) (3)
Global Data Flow Analysis Problems Arising in Locally Least-Cost Error Recovery (1984) (3)
The capacity-C torch problem (2015) (2)
Factor theory and the unity of opposites (2016) (2)
Fixed point calculus applied to generic programming: part 1 and 2 (1998) (2)
A comparison of gaussian and gauss-jordan elimination in regular algebra (1982) (2)
Constructive type theory: a perspective from computing science (1989) (2)
Datatype-Generic Termination Proofs (2008) (2)
Algebra of Program Termination (2000) (1)
An alternative implementation of an insertion-only recovery technique (1982) (1)
The Art of Effective Reasoning (2002) (1)
An Analysis of Repeated Graph Search (2019) (1)
The Capacity-CTorch Problem (2008) (1)
Constructive Lattice Theory (1993) (1)
MathSpad : ergonomic document preparation (1995) (1)
Matsad Tool Support for the Calculational Method (1996) (1)
Type-theoretic design patterns (2006) (1)
MathSpad user manual : draft (1994) (0)
Extracting proofs from documents (1998) (0)
Language-Processing Problems (2003) (0)
Mathematics of program construction : 5th International Conference, MPC 2000, Ponte de Lima, Portugal, July 3-5, 2000 : proceedings (2000) (0)
Proceedings of the 5th International Conference on Mathematics of Program Construction (2000) (0)
Mathematics of Program Construction (1996) (0)
On induced congruences (1990) (0)
First-past-the-post and Penney-Ante Games (2009) (0)
Datatype-generic programming : International Spring School, SSDGP 2006, Nottingham, UK, April 24-27, 2006 : revised lectures (2007) (0)
Datatype-Generic Reasoning (2006) (0)
The Return of Factor Theory (2002) (0)
Computing Kernels of a Graph – A Relation-Algebraic Approach Prototyping Relational Specifications Using Higher-Order Objects (2008) (0)
Writing a Number as a Sum of Two Squares: A New Solution (1982) (0)
Proceedings of the 2006 international conference on Datatype-generic programming (2006) (0)
Components and acyclicity of graphs. An exercise in combining precision with concision (2021) (0)
An Analysis of Choice in Program Design (1983) (0)
Calculational Derivation of Circuits (2015) (0)
Algebraic Approaches to Problem Generalisation (2004) (0)
Newsletter of the S I G a L a Special Interest Group on Algebraic Logic and Its Applications Volume 2 -number 1 (2007) (0)
Non-redundant Regular Expressions and Real Arithmetic: Proof of a Lemma Due to Tarjan (0)
Applications of Kleene Algebra (Dagstuhl Seminar 01081) (2021) (0)
Deriving a systolic language recogniser (1997) (0)
Meeting a fanclub: a lattice of generic shape selectors (2009) (0)
First-past-the-post games (2012) (0)

This paper list is powered by the following services:

Other Resources About Roland Carl Backhouse

What Schools Are Affiliated With Roland Carl Backhouse?

Roland Carl Backhouse is affiliated with the following schools:

Image Attributions

Image Source for Roland Carl Backhouse