From post

Graph Rewriting as a Computational Model.

, и . Concurrency: Theory, Language, And Architecture, том 491 из Lecture Notes in Computer Science, стр. 235-256. Springer, (1989)

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.

 

Другие публикации лиц с тем же именем

Director Strings as Combinators., и . ACM Trans. Program. Lang. Syst., 10 (4): 602-626 (1988)Infinitary Lambda Calculi and Böhm Models., , , и . RTA, том 914 из Lecture Notes in Computer Science, стр. 257-270. Springer, (1995)Syntactic Definitions of Undefined: On Defining the Undefined., , , , и . TACS, том 789 из Lecture Notes in Computer Science, стр. 543-554. Springer, (1994)Needed Reduction and Spine Strategies for the Lambda Calculus, , , и . Inf. Comput., 75 (3): 191-231 (декабря 1987)Comparing Curried and Uncurried Rewriting., , , и . J. Symb. Comput., 21 (1): 15-39 (1996)Infinitary Rewriting: From Syntax to Semantics., , , и . Processes, Terms and Cycles, том 3838 из Lecture Notes in Computer Science, стр. 148-172. Springer, (2005)Applicative Caching., и . ACM Trans. Program. Lang. Syst., 8 (1): 88-108 (1986)On the Adequacy of Graph Rewriting for Simulating Term Rewriting., , , и . ACM Trans. Program. Lang. Syst., 16 (3): 493-523 (1994)Transfinite Reductions in Orthogonal Term Rewriting Systems (Extended Abstract)., , , и . RTA, том 488 из Lecture Notes in Computer Science, стр. 1-12. Springer, (1991)Term Graph Rewriting., , , , , и . PARLE (2), том 259 из Lecture Notes in Computer Science, стр. 141-158. Springer, (1987)