Skip to main content
SpringerLink
Log in
Book cover

International Workshop on Computer Science Logic

CSL 1997: Computer Science Logic pp 341–359Cite as

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

  • Conference paper
  • First Online:

  • 115 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1414))

This is a preview of subscription content, log in via an institution.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  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.

    Google Scholar 

  2. Stephen L. Bloom and Zoltan Ésik. Iteration theories: the equational logic of iterative processes. EATCS Monographs in Theoretical Computer Science. Springer-Verlag, Berlin, 1993.

    Google Scholar 

  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.

    Google Scholar 

  4. E. W. Dijkstra. A discipline of programming. Prentice-Hall, 1976.

    Google Scholar 

  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.

    Google Scholar 

  6. Yiannis N. Moschovakis. The formal language of recursion. The Journal of Symbolic Logic, 54:1216–1252, 1989.

    Google Scholar 

  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.

    Google Scholar 

  8. Yiannis N. Moschovakis. Computable processes, Extended abstract. In Proceedings of the 1990 POPL meeting in San Francisco. Association for Computing Machinery, 1990.

    Google Scholar 

  9. Yiannis N. Moschovakis. A model of concurrency with fair merge and full recursion. Information and Computation, 93:114–171, 1991.

    Article  Google Scholar 

  10. Yiannis N. Moschovakis. Computable concurrent processes. Theoretical Computer Science, 139:243–273, 1995.

    Article  Google Scholar 

  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.

    Google Scholar 

  12. Yiannis N. Moschovakis and Glen T. Whitney. Powerdomains, powerstructures and fairness. In L. Pacholski and J. Tiuryn, editors, Computer Science Logic, number 933 in Lecture Notes in Computer Science, pages 382–396, Berlin, 1995. Springer-Verlag.

    Google Scholar 

  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.

    Google Scholar 

  14. David Park. The “fairness” problem and nondeterministic computing networks. In Foundations of Computer Science IV, pages 33–162, Amsterdam, 1983. Mathematisch Centrum.

    Google Scholar 

  15. G. D. Plotkin. A powerdomain construction. SIAM Journal of Computation, 5:452–487, 1976.

    Article  Google Scholar 

  16. G. D. Plotkin. LCF as a programming language. Theoretical Computer Science, 5:223–255, 1977.

    Article  Google Scholar 

  17. Gian-Carlo Rota. Ten lessons I wish I had been taught. Notices of the American Mathematical Society, 44:22–25, 1997.

    MathSciNet  Google Scholar 

  18. D. S. Scott and C. Strachey. Towards a mathematical semantics for computer languages. In J. Fox, editor, Proceedings of the Symposium on computers and automata, pages 19–46, New York, 1971. Polytechnic Institute of Brooklyn Press.

    Google Scholar 

  19. M. B. Smyth. Modeling concurrency with partial orders. Journal of Computing System Science, 16:23–36, 1978.

    Article  Google Scholar 

  20. Glen T. Whitney. Recursion structures for non-determinism and concurrency. PhD thesis, UCLA, 1994.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, University of California, 90095-1555, Los Angeles, CA, USA

    Yiannis N. Moschovakis

  2. Department of Mathematics, University of Athens, Panepistimioupolis, Athens, Greece

    Yiannis N. Moschovakis

Authors
  1. Yiannis N. Moschovakis
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Mogens Nielsen Wolfgang Thomas

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Moschovakis, Y.N. (1998). A game-theoretic, concurrent and fair model of the typed λ-calculus, with full recursion. In: Nielsen, M., Thomas, W. (eds) Computer Science Logic. CSL 1997. Lecture Notes in Computer Science, vol 1414. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0028024

Download citation

  • DOI: https://doi.org/10.1007/BFb0028024

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-64570-2

  • Online ISBN: 978-3-540-69353-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation