Skip to main content

Bistructures, bidomains and linear logic

  • Conference paper
  • First Online:
Automata, Languages and Programming (ICALP 1994)

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

Included in the following conference series:

Abstract

Bistructures are a generalisation of event structures to represent spaces of functions at higher types; the partial order of causal dependency is replaced by two orders, one associated with input and the other output in the behaviour of functions. Bistructures form a categorical model of Girard's classical linear logic in which the involution of linear logic is modelled, roughly speaking, by a reversal of the roles of input and output. The comonad of the model has associated co-Kleisli category which is equivalent to a cartesian-closed full subcategory of Berry's bidomains.

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Abramsky, S., Jagadeesan, R., and Malacaria, P., Games and full abstraction for PCF (first and second preliminary announcement). Linear Logic and Types electronic newsgroups, 1993.

    Google Scholar 

  2. Berry, G., Modèles complètement adéquats et stables des lambda-calculs typés. Thèse de Doctorat d'Etat, Université de Paris VII, 1979.

    Google Scholar 

  3. Curien, P-L., Categorical combinators, sequential algorithms, and functional programming. Second edition, Birkhäuser, 1993.

    Google Scholar 

  4. Girard, J-Y., Linear logic. Theoretical Computer Science 50, 1987.

    Google Scholar 

  5. Girard, J-Y., Lafont, Y., and Taylor, P., Proof and types. Cambridge University Press, 1989.

    Google Scholar 

  6. Hyland, J.M.E., and Ong, C-H.L., Games and full abstraction for PCF. Linear Logic and Types electronic newsgroups, 1993.

    Google Scholar 

  7. Lamarche, F., Sequentiality, games and linear logic. Proceedings of the CLICS Workshop, Aarhus University, March 1992, Aarhus University DAIMI PB-397 (II), 1992.

    Google Scholar 

  8. Nielsen, M., Plotkin, G., and Winskel, G., Petri nets, Event structures and Domains, part 1. Theoretical Computer Science, vol. 13, 1981.

    Google Scholar 

  9. Seely, R.A.G., Linear logic, *-autonomous categories and cofree coalgebras. Contempory Mathematics, vol.92, 1989.

    Google Scholar 

  10. Winskel, G., Events in Computation. PhD thesis, University of Edinburgh, available as a Comp. Sc. report, 1980.

    Google Scholar 

  11. Winskel, G., Event structures. Lectures for the Advanced Course on Petri nets, September 1986, Springer Lecture Notes in C.S., vol.255, 1987.

    Google Scholar 

  12. Winskel, G., An introduction to event structures. In the lecture notes for the REX summerschool in temporal logic, May 88, in Springer Lecture Notes in C.S., vol.354, 1989.

    Google Scholar 

  13. Zhang, G.Q., Logic of domains. Birkhäuser, 1991.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Serge Abiteboul Eli Shamir

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Plotkin, G., Winskel, G. (1994). Bistructures, bidomains and linear logic. In: Abiteboul, S., Shamir, E. (eds) Automata, Languages and Programming. ICALP 1994. Lecture Notes in Computer Science, vol 820. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58201-0_81

Download citation

  • DOI: https://doi.org/10.1007/3-540-58201-0_81

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-58201-4

  • Online ISBN: 978-3-540-48566-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics