( en | de | ru )

 

Disambiguation of "Backhouse, Roland Carl"

Author of the publication

copydeleteadd this publication to your clipboard
Program construction and verification.

. PHI Series in computer science Prentice Hall, (1986)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Maria Backhouse

Andrew Backhouse

Carl Roland Hülse

Carl-Roland Rabl

Uwe Carl Ernst Roland

 

Other publications of authors with the same name

First-Past-the-Post Games.. MPC, volume 7342 of Lecture Notes in Computer Science, page 157-176. Springer, (2012)Calculating a Round-Robin Scheduler., and . MPC, volume 1422 of Lecture Notes in Computer Science, page 365-382. Springer, (1998)When Do Datatypes Commute?, and . Category Theory and Computer Science, volume 1290 of Lecture Notes in Computer Science, page 242-260. Springer, (1997)The algorithmics of solitaire-like games., , and . Sci. Comput. Program., 78 (11): 2029-2046 (2013)Calculating Path Algorithms., , and . Sci. Comput. Program., 22 (1-2): 3-19 (1994)Closure algorithms and the star-height problem of regular languages.. Imperial College London, UK, (1976)British Library, EThOS.Final dialgebras: From categories to allegories., and . RAIRO Theor. Informatics Appl., 33 (4/5): 401-426 (1999)Elements of a Relational Theory of Datatypes., and . Formal Program Development, volume 755 of Lecture Notes in Computer Science, page 7-42. Springer, (1993)Categorical Fixed Point Calculus., , , and . Category Theory and Computer Science, volume 953 of Lecture Notes in Computer Science, page 159-179. Springer, (1995)Fixed-Point Characterisation of Winning Strategies in Impartial Games., and . RelMiCS, volume 3051 of Lecture Notes in Computer Science, page 34-47. Springer, (2003)