Higher-order processes and their models

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

Volumn 820 LNCS, Issue , 1994, Pages 286-303

  Hennessy, M ^a  

^a UNIVERSITY OF SUSSEX   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; ROBOTS; SEMANTICS;

DENOTATIONAL MODELS; DENOTATIONAL SEMANTICS; HIGHER-ORDER; HIGHER-ORDER PROCESS; MAY TESTING; OPERATIONAL SEMANTICS; PREORDERS;

ABILITY TESTING;

EID: 85027403156     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-58201-0_76     Document Type: Conference Paper

References (16)

1. S. Abramsky. The lazy lambda calculus. In D. Turner, editor, Research Topics in Functional Programming, pages 65-117. Addison-Wesley, 1990.
2. Samson Abramsky. Domain theory in logical form. Ann. Pure Appl. Logic, 51:1-77, 1991.
3. H. Barendregt, M. Coppo, and M. Dezani-Ciancaglini. A filter model and the completeness of type assignment. J. of Symbolic Logic, 48:931-940, 1983.
4. M. Dezani-Ciancaglini, U. de’Liguoro, and A. Piperno. Fully abstract logical semantics for a parallel and nondeterministic lambda-calculus. In Proceedings of TACS94, 1994.
5. M. Dezani-Ciancaglini, U. de’Liguoro, and P. van Rossum. A type assignment system for higher-order communicating processes. Technical report, Universita di Torino, 1994.
6. A. Giacalone, P. Mistra, and S. Prasad. Operational and algebraic semantics for facile: A symmetric integration of concurrent and functional programming. In Proceedings of ICALP 90, volume 443 of Lecture Notes in Computer Science, pages 765-780, 1990.
7. Carl Gunter. Semantics of Programming Languages. MIT Press, 1992.
8. M. Hennessy. An Algebraic Theory of Processes. MIT Press, 1988.
9. M. Hennessy. A fully abstract denotational model for higher-order processes. In Procedings of LICS 94, pages 397-408. IEEE Computer Society Press, 1994. To appear in Information and Computation.
10. R. Milner. Communication and Concurrency. Prentice-Hall, 1989.
11. James Morris. Lambda-Calculus Models of Programming Languages. Ph.d. thesis, MIT, 1968.
12. G. Plotkin. LCF considered as a programming language. Theoretical Computer Science, 5:323-255, 1977.
13. J. H. Reppy. A higher-order concurrent language. In Proceedings of the ACM SIGPLAN 91 PLDI, number 26 in SIGPLAN Notices, pages 294-305, 1991.
14. J. Reppy. Higher-Order Concurrency. Ph.d. thesis, Cornell University, 1992.
15. D. Sangiorgo. Expressing Mobility in Process Algebras: First-Order and Higher-Order Paradigms. Phd thesis, Edinburgh University, Scotland, 1992.
16. B. Thomsen. Calculi for Higher-Order Communicating Systems. Phd thesis, Imperial College, 1990.