A relational account of call-by-value sequentiality

Information and Computation

Volumn 179, Issue 2, 2002, Pages 296-331

  Riecke, Jon G ^a   Sandholm, Anders ^b  

^a LUCENT TECHNOLOGIES   (United States)

^b AARHUS UNIVERSITY   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SIMULATION; FORMAL LOGIC; FUNCTION EVALUATION; PROBLEM SOLVING; SEMANTICS;

FUNCTIONAL COMPUTATION;

COMPUTER PROGRAMMING LANGUAGES;

EID: 0037115351     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1006/inco.2002.2957     Document Type: Conference Paper

References (41)

1. Abadi, M., and Fiore, M.P. (1996), Syntactic considerations on recursive types, in "Proceedings, Eleventh Annual IEEE Symposium on Logic in Computer Science," pp. 242-252.
2. Abramsky, S., and Jung, A. (1994), Domain theory, in "Handbook of Logic in Computer Science" (S. Abramsky, D.M. Gabbay, and T.S.E. Maibaum, Eds.), Vol. 3, pp. 1-168, Clarendon, Oxford.
3. Abramsky, S., Matacaria, P., and Jagadeesan, R. (1994), Full abstraction for PCF (extended abstract), in "Theoretical Aspects of Computer Software" (M. Hagiya and J. Mitchell, Eds.), Lecture Notes in Computer Science, Vol. 789, pp. 1-15, Springer-Verlag, Berlin.
4. Abramsky, S., and McCusker, G. (1997), Call-by-value games, submitted for publication.
5. Astesiano, E., and Costa, G. (1980), Nondeterminism and fully abstract models, RAIRO 14(4), 323-347.
6. Curien, P.-L. (1986), "Categorical Combinators, Sequential Algorithms and Functional Programming," Wiley, New York.
7. Curien, P.-L., and Obtulowicz, A. (1989), Partiality, cartesian closedness, and toposes, Inform. and Comput. 80, 50-95.
8. Fiore, M., and Simpson, A. (1999), Lambda definability with sums via Grothendieck logical relations, in "Typed Lambda Calculi and Applications," Lecture Notes in Computer Science, Springer-Verlag, Berlin, to appear.
9. Girard, J.-Y. (1971), Une extension de l'interprétation de Gödel à l'analyse, et son application à l'élimination des coupures dans l'analyse et la théorie des types, in "Proceedings of the Second Scandinavian Logic Symposium" (J.E. Fenstad, Ed.), Studies in Logic and the Foundations of Mathematics, Vol. 63, pp. 63-92, North-Holland, Amsterdam.
10. Gunter, C.A. (1992), "Semantics of Programming Languages: Structures and Techniques," MIT Press, Cambridge, MA.
11. Gunter, C.A., and Scott, D.S. (1990), Semantic domains, in "Handbook of Theoretical Computer Science" (J. van Leeuwen, Ed.), Vol. B, pp. 633-674, Elsevier, Amsterdam/New York.
12. Honda, K., and Yoshida, N. (1997), Game theoretic analysis of call-by-value computation, in "Automata, Languages and Programming: 24th International Colloquium" (P. Degano, R. Gorrieri, and A. Marchetti-Spaccamela, Eds.), Lecture Notes in Computer Science, Vol. 1256, Springer-Verlag, Berlin.
13. Hyland, J.M.E., and Ong, C.-H.L. (1995), Pi-calculus, dialogue games and PCF, Presented at 7th Annual ACM Conference on Functional Programming Languages and Computer Architecture, La Jolla, California.
14. Jung, A., Fiore, M., Moggi, E., O'Hearn, P.W., Riecke, J.G., Rosolini, G., and Stark, I. (1996), Domains and denotational semantics: History, accomplishments, and open problems, Bulletin of the European Association for Theoretical Computer Science, 227-256.
15. Jung, A., and Stoughton, A. (1993), Studying the fully abstract model of PCF within its continuous function model, in "Typed Lambda Calculi and Applications," Lecture Notes in Computer Science, Vol. 664, pp. 230-244, Springer-Verlag, Berlin.
16. Jung, A., and Tiuryn, J. (1993), A new characterization of lambda definability, in "Typed Lambda Calculi and Applications," Lecture Notes in Computer Science, Vol. 664, pp. 245-257, Springer-Verlag, Berlin.
17. Loader, R. (1997), Finitary PCF is not decidable, available at http://www.dcs.ed.ac.uk/~loader.
18. McCusker, G. (1996), Games and full abstraction for FPC, in "Proceedings, Eleventh Annual IEEE Symposium on Logic in Computer Science," pp. 174-183.
19. McCusker, G. (1997), Games and definability for FPC, Bull. Symbol. Logic 3(3), 347-362.
20. Marz, M. (1998), "A Fully Abstract Model for Sequential Computation," Technical Report CSR-98-06, Department of Computer Science, University of Birmingham.
21. Meyer, A.R. (1988), Semantical paradigms: Notes for an invited lecture, with two appendices by Stavros S. Cosmadakis, in "Proceedings, Third Annual Symposium on Logic in Computer Science," pp. 236-255, IEEE Press, New York.
22. Milner, R. (1977), Fully abstract models; of the typed lambda calculus, Theor Comput. Sci. 4, 1-22.
23. Milner, R., Torte, M., Harper, R., and MacQueen, D. (1997), "The Definition of Standard ML," revised, MIT Press, Cambridge, MA.
24. Moggi, E. (1991), Notions of computation and monads, Inform. and Control 93, 55-92.
25. Mulmuley, K. (1987), "Full Abstraction and Semantic Equivalence," ACM Doctoral Dissertation Award 1986, MIT Press, Cambridge, MA.
26. Nickau, H. (1994), Hereditarily sequential functionals, in "Proceedings of the Symposium on Logical Foundations of Computer Science: Logic at St. Petersburg" (A. Nerode and Y. Matiyasevich, Eds.), Lecture Notes in Computer Science, Vol. 813, Springer-Verlag, Berlin.
27. O'Hearn, P.W., and Reynolds, J.C. (1997), From Algol to polymorphic linear lambda calculus, available at http:// www.dcs.qmw.ac.uk/ohearn.
28. O'Hearn, P.W., and Riecke, J.G. (1995), Kripke logical relations and PCP, Inform. and Comput. 120(1), 107-116.
29. O'Hearn, P.W., and Tennent, R.D. (1995), Parametricity and local variables, J. Assoc. Comput. Mach. 42, 658-709.
30. Pitts, A.M. (1996), Relational properties of domains, Inform, and Comput. 127, 66-90.
31. Plotkin, G.D. (1977), LCF considered as a programming language, Theor. Comput. Sci. 5, 223-257.
32. Plotkin G.D. (1985), (Towards a) logic for computable functions, CSLI Summer School Notes, unpublished manuscript.
33. Reynolds, J.C. (1974), Towards a theory of type structure, in "Proceedings Colloque sur la Programmation," Lecture Notes in Computer Science, Vol. 19, pp. 408-425, Springer-Verlag, Berlin.
34. Reynolds, J.C. (1981), The essence of Algol, in "Algorithmic Languages" (J.W. de Bakker and J.C. van Vliet, Eds.), pp. 345-372, North-Holland, Amsterdam.
35. Riecke, J.G. (1993), Fully abstract translations between functional languages, Mathematical Structures in Computer Science 3, 387-415. Preliminary version (1991), in "Conference Record of the Eighteenth Annual ACM Symposium on Principles of Programming Languages," pp. 245-254, Assoc. Comput. Mach., New York.
36. Riecke, J.G., and Subrahmanyam, R. (1997), Semantic orthogonality of type disciplines, available at http://www.cs. bell-labs.com/who/riecke/.
37. Riecke, J.G., and Viswanathan, R. (1993), Full abstraction for call-by-value sequential languages, unpublished manuscript.
38. Riecke, J.G., and Viswanathan, R. (1995), Isolating side effects in sequential languages, in "Conference Record of the Twenty-Second Annual ACM Symposium on Principles of Programming Languages," pp. 1-12, Assoc. Comput. Mach., New York.
39. Sieber, K. (1992), Reasoning about sequential functions via logical relations, in "Applications of Categories in Computer Science," London Mathematical Society Lecture Note Series, Vol. 177, Cambridge Univ. Press, Cambridge, UK.
40. Stoughton, A. (1988), "Fully Abstract Models of Programming Languages," Research Notes in Theoretical Computer Science, Pitman/Wiley. Revision of Ph.D. thesis, Report No. CST-40-86, 1986, Department of Computer Science, University Edinburgh.
41. Wechler, W. (1992), "Universal Algebra for Computer Scientists," EATCS Monographs in Theoretical Computer Science, No. 25, Springer-Verlag, Berlin.