Author of the publication

Rewriting Game Theory as a Foundation for State-Based Models of Gene Regulation.

, , , , and . CMSB, volume 4210 of Lecture Notes in Computer Science, page 257-270. Springer, (2006)

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

Formalizing Adequacy: A Case Study for Higher-order Abstract Syntax., , and . J. Autom. Reasoning, 49 (2): 209-239 (2012)A Formalised First-Order Confluence Proof for the lambda-Calculus Using One-Sorted Variable Names., and . RTA, volume 2051 of Lecture Notes in Computer Science, page 306-321. Springer, (2001)Cascaded Games., , and . AB, volume 4545 of Lecture Notes in Computer Science, page 185-201. Springer, (2007)Semantics-Based Compiling: A Case Study in Type-Directed Partial Evaluation., and . PLILP, volume 1140 of Lecture Notes in Computer Science, page 182-197. Springer, (1996)Equational Reasoning for Linking with First-Class Primitive Modules., and . ESOP, volume 1782 of Lecture Notes in Computer Science, page 412-428. Springer, (2000)Rewriting Game Theory as a Foundation for State-Based Models of Gene Regulation., , , , and . CMSB, volume 4210 of Lecture Notes in Computer Science, page 257-270. Springer, (2006)The Mechanisation of Barendregt-Style Equational Proofs (the Residual Perspective)., and . Electr. Notes Theor. Comput. Sci., 58 (1): 18-36 (2001)A constructive approach to sequential Nash equilibria.. Inf. Process. Lett., 97 (2): 46-51 (2006)Proof Pearl: De Bruijn Terms Really Do Work., and . TPHOLs, volume 4732 of Lecture Notes in Computer Science, page 207-222. Springer, (2007)A formalised first-order confluence proof for the -calculus using one-sorted variable names., and . Inf. Comput., 183 (2): 212-244 (2003)