Full abstractness for a functional/concurrent language with higher-order value-passing

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

Volumn 1414, Issue , 1998, Pages 239-254

  Hartonas, Chrysafis ^a   Hennessy, Matthew ^a  

^a UNIVERSITY OF SUSSEX   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

CALCULATIONS; COMPUTATIONAL LINGUISTICS; DIFFERENTIATION (CALCULUS); RECONFIGURABLE HARDWARE; SEMANTICS;

ALGEBRAIC LATTICES; BOOLEAN VALUES; CALL-BY-VALUE LAMBDA CALCULUS; HIGHER ORDER FUNCTIONS; LABELLED TRANSITION SYSTEMS; OPERATIONAL SEMANTICS; PROCESS CALCULI; STANDARD DOMAINS;

COMPUTER CIRCUITS;

EID: 0346556352     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/BFb0028018     Document Type: Conference Paper

References (33)

1. S. Abramsky, D.M. Gabbay and T.S.E. Maibaum, (eds) Handbook of Logic in Computer Science vol. 1-6, Oxford Science Publications, Clarendon Press, Oxford 1994.
2. S. Abramsky, “Domain Theory in Logical Form”, Annals of Pure and Applied Logic, vol. 51, pp. 1-77, 1991.
3. S. Abramsky, “A Domain Equation for Bisimulation”, Information and Computation, vol. 92, pp. 161-218, 1991.
4. R. M. Amadio, “Translating Core Facile”, Technical Report ECRC-1994-3, European Computer-Industry Research Center, Munich, 1994.
5. H.P. BARENDREGT, The λ-Calculus, its Syntax and Semantics, North-Holland, Amsterdam, 1984.
6. G. Boudol, “A A-Calculus for (Strict) Parallel Functions”, Information and Computation, vol. 108, pp. 51-127, 1994.
7. H. Barendregt, M. Coppo and M. Dezani-Ciancaglini, “A Filter Model and the Completeness of Type Assignment”, Journal of Symbolic Logic, vol. 48, pp. 931-940, 1983.
8. M. Dezani-Ciancaglini, U. de Liguoro and A. Piperno, “Fully Abstract Semantics for Concurrent Lambda-Calculus". Proc. TACS’94, LNCS 789, Springer-Verlag, Berlin 1994, 16-35.
9. A. Giacalone, P. Mishra and S. Prasad, “FACILE: A symmetric integration of Concurrent and Functional Programming”, International Journal of Parallel Programming, vol. 15, No 2, pp. 121-160, 1989.
10. W. Fereira, M. Hennessy and A. Jeffrey, “Combining the Typed λ-Calculus with CCS”, Report 2/96, University of Sussex, Computer Science, May 1996.
11. C. Fournet and G. Gonthier, “The Reflexive CHAM and the Join-Calculus”, Proc. POPL 94, 1994.
12. A. Jeffrey, “A Fully Abstract Semantics for a Concurrent Functional Language with Monadic Types”, Proc. LICS’95, 1995.
13. C. Hartonas and M. Hennessy, “Full Abstractness for a Functional/Concurrent Language with Higher-Order Value-Passing”, University of Sussex, Computer Science Technical Report 02/97. To appear in Information and Computation.
14. M. Hennessy, An Algebraic Theory of Processes, MIT Press, Cambridge, MA, 1988.
15. M. Hennessy, “A Fully Abstract Denotational Model for Higher-Order Processes”, Information and Computation vol. 112, No 1, pp. 55-95, 1994.
16. M. Hennessy, “Higher-Order Processes and their Models”, ICALP’94
17. K.G. Larsen, “Proof Systems for Satisfiability in Hennessy-Milner Logic with Recursion”, Theoretical Computer Science vol. 72, 265-288, 1990.
18. R. MILNER, Communication and Concurrency, Prentice-Hall, Englewood Cliffs, NJ, 1989.
19. R. Milner, J. Parrow and D. Walker, “A Calculus of Mobile Processes I, II”, Information and Computation vol. 100, pp. 1-40, pp. 41-77, 1992.
20. E. Moggi, “Notions of Computation and Monads”, Information and Computation 93, 1991, pp. 55-92.
21. J. Morris, “Lambda-Calculus Models of Programming Languages”, Ph.D. Thesis, MIT, 1968.
22. G. Plotkin, “A Powerdomain Construction”, SIAM Journal on Computation, vol 5, pp. 452-487, 1976.
23. G. Plotkin, “LCF Considered as a Programming Language”, Theoretical Computer Science vol. 5, pp. 323-355, 1997.
24. J.H. Reppy, “A Higher-Order Concurrent Language”, in Proceedings of the ACM SIGPLAN’91 PLDI, SIGPLAN Notices, No 26, pp. 294-305, 1991.
25. J.H. Reppy, Higher-Order Concurrency, Ph.D. thesis, Cornell University, 1991.
26. J. Reppy, “CML: A Higher-Order Concurrent Language”, in Proc. ACM-SIGPLAN 91, Conf. on Programming Language Design and Implementation, 1991.
27. K. SIEBER, “Call-by-Value and Nondeterminism”, in Typed X-Calculi and Applications, eds. M. Bezen and J.F. Groote, LNCS 664, Springer-Verlag 1993.
28. I. STARK, “A Fully-Abstract Domain Model for the 7r-Calculus”, Proc. LICS’96, 1996.
29. C. Stirling, “A Proof-Theoretic Characterization of Observational Equivalence”, Theoretical Computer Science vol. 39, 27-45, 1985.
30. C. STIRLING, “Modal Logics for Communicating Systems”, Theoretical Computer Science vol. 49, 311-347, 1987.
31. B. THOMSEN, Calculi for Higher-Order Communicating Systems, Ph.D. thesis, Imperial College, 1990.
32. B. Thomsen, “Plain Chocs: A Second Generation Calculus for Higher Order Processes”, Acta Informatica vol. 30, pp. 1-59, 1993.
33. G. Winskel, “A Complete Proof System for SCCS with Modal Assertions”, LNCS vol. 206, 392-410, 1985.