A game-theoretic, concurrent and fair model of the typed λ-calculus, with full recursion

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1414, Issue , 1998, Pages 341-359

  Moschovakis, Yiannis N ^a,b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b UNIVERSITY OF ATHENS   (Greece)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84957667159     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/BFb0028024     Document Type: Conference Paper

References (20)

1. G. Kahn, B. Courcelle and J. Vuillemin. Algorithmes d’equivalence et de reduction a des expressions minimales dans une classe d’equations recursives simples. In J. Loeckx, editor, Automata, Languages, and Programming, 2nd Colloquium, volume 14 of Lecture Notes in Computer Science. Springer Verlag, 1974.
2. Stephen L. Bloom and Zoltan Esik, Iteration theories: the equational logic of iterative processes. EATCS Monographs in Theoretical Computer Science. Springer-Verlag, Berlin, 1993.
3. J. D. Brock and W. B. Ackerman. Scenarios: a model of non-determinate computation. In J. Diaz and I. Ramos, editors, Formalization of programming concepts, volume 107 of Lecture Notes in Computer Science, pages 252-259. Springer Verlag, 1981.
4. E. W. Dijkstra. A discipline of programming. Prentice-Hall, 1976.
5. A. J. C. Hurkens, Monica McArthur, Yiannis N. Moschovakis, Lawrence Moss, and Glen T. Whitney. The logic of recursive equations. To appear in the Journal of Symbolic Logic.
6. Yiannis N. Moschovakis. The formal language of recursion. The Journal of Symbolic Logic, 54:1216-1252, 1989.
7. Yiannis N. Moschovakis. A game-theoretic modeling of concurrency, Extended abstract. In Proceedings of the fourth annual symposium on Logic in Computer Science, pages 154-183. IEEE Computer Society Press, 1989.
8. Yiannis N. Moschovakis. Computable processes, Extended abstract. In Proceedings of the 1990 POPL meeting in San Francisco. Association for Computing Machinery, 1990.
9. Yiannis N. Moschovakis. A model of concurrency with fair merge and full recursion. Information and Computation, 93:114-171, 1991.
10. Yiannis N. Moschovakis. Computable concurrent processes. Theoretical Computer Science, 139:243-273, 1995.
11. Yiannis N. Moschovakis. The logic of functional recursion. In M. L. Dalla Chiara et. al, editor, Logic and scientific method, pages 179-207. Kluwer Academic Publishers, 1997.
12. Yiannis N. Moschovakis and Glen T. Whitney. Powerdomains, powerstructures and fairness. In L. Paeholski and J. Tiuryn, editors, Computer Science Logic, number 933 in Lecture Notes in Computer Science, pages 382-396, Berlin, 1995. Springer-Verlag.
13. David Park. On the semantics of fair parallelism. In Proceedings of the Copenhagen Winter School, volume 104 of Lecture Notes in Computer Science, pages 504-526. Springer Verlag, 1980.
14. David Park. The “fairness” problem and nondeterministic computing networks. In Foundations of Computer Science IV, pages 33-162, Amsterdam, 1983. Mathematisch Centrum.
15. G. D. Plotkin. A powerdomain construction. SIAM Journal of Computation, 5:452-487, 1976.
16. G. D. Plotkin. LCF as a programming language. Theoretical Computer Science, 5:223-255, 1977.
17. Gian-Carlo Rota. Ten lessons I wish I had been taught. Notices of the American Mathematical Society, 44:22-25, 1997.
18. D. S. Scott and C. Strachey. Towards a mathematical semantics for computer languages. In J. Pox, editor, Proceedings of the Symposium on computers and automata, pages 19-46, New York, 1971. Polytechnic Institute of Brooklyn Press.
19. M. B. Smyth. Modeling concurrency with partial orders. Journal of Computing System Science, 16:23-36, 1978.
20. Glen T. Whitney. Recursion structures for non-determinism and concurrency. PhD thesis, UCLA, 1994.