A linear metalanguage for concurrency

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

Volumn 1548, Issue , 1998, Pages 42-58

  Winskel, Glynn ^a  

^a AARHUS UNIVERSITY   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; COMPUTATIONAL LINGUISTICS; SOFTWARE ENGINEERING;

BISIMULATIONS; CATEGORICAL MODEL; CONCURRENT PROCESS; HIGHER-ORDER PROCESS; LINEAR LOGIC; OPEN MAPS; PRESHEAF; PROCESS LANGUAGES;

METALS;

EID: 84958958807     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-49253-4_6     Document Type: Conference Paper

References (17)

1. S. Abramsky. Computational interpretation of linear logic. Tech. Report 90/20, Dept. of Computing, Imperial College, 1990.
2. G. L. Cattani. Forthcoming PhD thesis, CS Dept., University of Aarhus.
3. G. L. Cattani, M. Fiore, and G. Winskel. A Theory of Recursive Domains with Applications to Concurrency. In Proc. of LICS’98.
4. G. L. Cattani, I. Stark, and G. Winskel. Presheaf Models for the π-Calculus. In Proc. of CTCS’97, LNCS 1290, 1997.
5. G. L. Cattani and G. Winskel. Presheaf Models for Concurrency. In Proc. of CSL’ 96, LNCS 1258, 1997.
6. G. L. Cattani and G. Winskel. On bisimulation for higher order processes. Manuscript, 1998.
7. G. L. Cattani, A. J. Power and G. Winskel. A categorical axiomatics for bisimulation. In Proc. of CONCUR’98, LNCS 1466, 1998.
8. M. Hennessy and G.D. Plotkin. Full abstraction for a simple parallel programming language. In Proc. of MFCS’79, LNCS 74, 1979.
9. C.A.R. Hoare. A model for communicating sequential processes. Tech. Report PRG-22, University of Oxford Computing Lab., 1981.
10. A. Joyal and I. Moerdijk. A completeness theorem for open maps. Annals of Pure and Applied Logic, 70:51–86, 1994.
11. A. Joyal, M. Nielsen, and G. Winskel. Bisimulation from open maps. Information and Computation, 127:164–185, 1996.
12. G. Winskel and K. Larsen. Using information systems to solve recursive domain equations effectively. LNCS 173, 1984.
13. R. Milner. Communication and concurrency. Prentice Hall, 1989.
14. R. Milner. Calculi for Interaction. Acta Informatica 33, 1996.
15. M. Nielsen, G.D. Plotkin and G. Winskel. Petri nets, Event structures and Domains, part 1. Theoretical Computer Science, vol. 13, 1981.
16. G. Winskel. An introduction to event structures. In Proc. of REX summer-school in temporal logic,’ May 88, LNCS 354, 1988.
17. G. Winskel. A presheaf semantics of value-passing processes. In Proceedi ngs of CONCUR’96, LNCS 1119, 1996.