Author of the publication

Rational Unification in 28 Characters.

, and . TERMGRAPH, volume 127 of Electronic Notes in Theoretical Computer Science, page 3-20. Elsevier, (2004)

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.

 

Other publications of authors with the same name

Depletable channels: dynamics, behaviour, and efficiency in network design., , and . Acta Inf., 56 (5): 405-431 (2019)Configuration Theories.. CSL, volume 2471 of Lecture Notes in Computer Science, page 200-215. Springer, (2002)Rational Unification in 28 Characters., and . TERMGRAPH, volume 127 of Electronic Notes in Theoretical Computer Science, page 3-20. Elsevier, (2004)Depletable Channels: Dynamics and Behaviour., , and . FCT, volume 5699 of Lecture Notes in Computer Science, page 50-61. Springer, (2009)Graph Theoretic Investigations on Inefficiencies in Network Models., , and . CoRR, (2016)Computational applications of calculi based on monads.. University of Edinburgh, UK, (1996)An Algebraic View of Program Composition.. AMAST, volume 1548 of Lecture Notes in Computer Science, page 325-340. Springer, (1998)Graph Theoretic Detection of Inefficiencies in Network Models., , and . ICTCS, volume 2243 of CEUR Workshop Proceedings, page 87-91. CEUR-WS.org, (2018)Ambient Graph Rewriting., , and . WRLA, volume 117 of Electronic Notes in Theoretical Computer Science, page 335-351. Elsevier, (2004)A Polynomial-time Algorithm for Detecting the Possibility of Braess Paradox in Directed Graphs., , and . CoRR, (2016)