( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
A Game-Theoretic, Concurrent and Fair Model of the Typed Lambda-calculus, with Full Recursion.

. CSL, том 1414 из Lecture Notes in Computer Science, стр. 341-359. Springer, (1997)

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.

n n n

Yiannis Kyriakou

Yiannis Siantos

Yiannis Kanellopoulos

Yiannis Georgiou

 

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

Meeting of the Association for Symbolic Logic: San Francisco, 1981., , и . J. Symb. Log., 48 (2): 505-513 (1983)Global Inductive Definability., и . J. Symb. Log., 43 (3): 521-534 (1978)Computable processes.. POPL, стр. 72-80. ACM Press, (1990)Is the Euclidean algorithm optimal among its peers?, и . Bull. Symb. Log., 10 (3): 390-418 (2004)A Model of Concurrency with Fair Merge and Full Recursion. Inf. Comput., 93 (1): 114-171 (июля 1991)Arithmetic complexity., и . ACM Trans. Comput. Log., 10 (1): 2:1-2:49 (2009)Powerdomains, Powerstructures and Fairness., и . CSL, том 933 из Lecture Notes in Computer Science, стр. 382-396. Springer, (1994)A Game-Theoretic, Concurrent and Fair Model of the Typed Lambda-calculus, with Full Recursion.. CSL, том 1414 из Lecture Notes in Computer Science, стр. 341-359. Springer, (1997)Computable Concurrent Processes.. Theor. Comput. Sci., 139 (1&2): 243-273 (1995)On primitive recursive algorithms and the greatest common divisor function.. Theor. Comput. Sci., 301 (1-3): 1-30 (2003)