HOPLA - A higher-order process language

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

Volumn 2421 LNCS, Issue , 2002, Pages 434-448

  Nygaard, Mikkel ^a   Winskel, Glynn ^b  

^a AARHUS UNIVERSITY   (Denmark)

^b UNIVERSITY OF CAMBRIDGE   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

CALCULATIONS; DIFFERENTIATION (CALCULUS); SEMANTICS; COMPUTATION THEORY;

COMPUTATION PATHS; EXPRESSIVE POWER; HIGHER-ORDER PROCESS; LAMBDA CALCULUS; MOBILE AMBIENTS; OPERATIONAL SEMANTICS; PROCESS LANGUAGES; PROCESS-PASSING; NON-DETERMINISTIC PROCESS;

COMPUTATION THEORY; COMPUTATIONAL LINGUISTICS;

EID: 23044532793     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45694-5_29     Document Type: Conference Paper

References (23)

1. S. Abramsky. The lazy lambda calculus. In D. Turner (ed): Research Topics in Functional Programming. Addison-Wesley, 1990.
2. L. Cardelli and A.D. Gordon. Anytime, anywhere. Modal logics for mobile ambients. In Proc. POPL'00.
3. L. Cardelli and A.D. Gordon.A commitment relation for the ambient calculus. Note. October 6th, 2000.
4. G.L. Cattani. Presheaf Models for Concurrency. BRICS Dissertation Series DS-99-1, 1999.
5. G.L. Cattani, M. Fiore, and G. Winskel. Weak bisimulation and open maps. In Proc. LICS'99.
6. G.L. Cattani, I. Stark, and G. Winskel. Presheaf models for the π-calculus. In Proc. CTCS'97, LNCS 1290.
7. G.L. Cattani and G. Winskel. Profunctors, open maps and bisimulation. Manuscript, 2000.
8. A.D. Gordon and L. Cardelli. Equational properties of mobile ambients. In Proc. FoSSaCS'99.
9. A.D. Gordon. Bisimilarity as a theory of functional programming. In Proc. MFPS'95, ENTCS 1.
10. M. Hennessy. A fully abstract denotational model for higher-order processes. Information and Computation, 112(1):55-95, 1994.
11. D.J. Howe. Proving congruence of bisimulation in functional programming languages. Information and Computation, 124(2):103-112, 1996.
12. A. Jeffrey and J. Rathke. Towards a theory of bisimulation for local names. In Proc. LICS'99.
13. A. Joyal and I. Moerdijk. A completeness theorem for open maps. Annals of Pure and Applied Logic, 70:51-86, 1994.
14. A. Joyal, M. Nielsen, and G. Winskel. Bisimulation from open maps. Information and Computation, 127:164-185, 1996.
15. G.M. Kelly. Basic concepts of enriched category theory. London Math. Soc. Lecture Note Series 64, CUP, 1982.
16. J.H. Morris. Lambda-Calculus Models of Programming Languages. PhD thesis, MIT, December 1968.
17. F. Nielson. The typed λ-calculus with first-class processes. In Proc. PARLE'89, LNCS 366.
18. M. Nygaard and G. Winskel. Linearity in process languages. In Proc. LICS'02.
19. D. Park. Concurrency and automata on infinite sequences. In Proc. 5th GI Conference, LNCS 104, 1981.
20. A.M. Pitts and I.D.B. Stark. Observable properties of higher order functions that dynamically create local names, or: What's new? In Proc. MFCS'93, LNCS 711.
21. R. Milner. Communication and Concurrency. Prentice Hall, 1989.
22. D. Sangiorgi. Expressing Mobility in Process Algebras: First-Order and HigherOrder Paradigms. PhD thesis, University of Edinburgh, 1992.
23. B. Thomsen. A calculus of higher order communicating systems. In Proc. POPL'89.