The semantics of future and an application

Journal of Functional Programming

Volumn 9, Issue 1, 1999, Pages 1-31

  Flanagan, C ^a,b   Felleisen, M ^a  

^a RICE UNIVERSITY   (United States)

^b Compaq System Research Center ^*  (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0033414373     PISSN: 09567968     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0956796899003329     Document Type: Article

References (43)

1. Aiken, A., Wimmers, E. L. and Lakshman, T. K. (1994) Soft typing with conditional types. Principles of Programming Languages, pp. 163-173.
2. Baker, H. G. and Hewitt, C. (1977) The incremental garbage collection of processes. Proceedings of the Symposium on Artificial Intelligence and Programming Languages, pp. 55-59. SIGPLAN Notices 12(8).
3. BBN Advanced Computers (1989) Inside the gp1000, BBN Advanced Computers, Inc., Cambridge, MA.
4. Cousot, P. and Cousot, R. (1977) Abstract interpretation: A unified lattice model for static analyses of programs by construction or approximation of fixpoints. Principles of Programming Languages, pp. 238-252.
5. Cousot, P. and Cousot, R. (1995) Formal language, grammar, and set-constraint-based program analysis by abstract interpretation. Functional Programming and Computer Architecture, pp. 170-181.
6. Cousot, P. and Cousot, R. (1994) Higer order abstract interpretation (and application to comportment analysis generalizing strictness, termination, projection and per analysis of functional languages). ICCL, pp. 95-112.
7. Deutsch, A. (1992) Modèles opérationnels de language de programmation et représentations de relations sue des languages rationnels avec application a la détermination statique de propriétes de partages dynamiques de données. PhD thesis, Universite Paris VI.
8. Fagan, M. (1990) Soft typing. PhD thesis, Rice University.
9. Feeley, M. (1993) An efficient and general implementation of futures on large scale shared-memory multiprocessors. PhD thesis, Department of Computer Science, Brandeis University.
10. Feeley, M. and Miller, J. S. (1990) A parallel virtual machine for efficient scheme compilation. Lisp and Functional Programming.
11. Felleisen, M. and Friedman, D. P. (1986) Control operators, the SECD-machine, and the lambda-calculus. 3rd Working Conference on the Formal Description of Programming Concepts, pp. 193-219.
12. Felleisen, M. and Friedman, D. P. (1987) A calculus for assignments in higher-order languages. Conference Record of the 14th Annual ACM Symposium on Principles of Programming Languages, pp. 314-345.
13. Felleisen, M. and Hieb, R. (1989) The revised report on the syntactic theories of sequential control and state. Technical Report 100, Rice University. (Theor. Comput. Sci. 102, 1992.)
14. Flanagan, C. (1997) Effective static debugging via componential set-based analysis. PhD thesis, Rice University, Houston, TX.
15. Flanagan, C. and Felleisen, M. (1994a) The semantics of Future. Rice University Computer Science TR94-238.
16. Flanagan, C. and Felleisen, M. (1994b) Well-founded touch optimization for futures. Rice University Computer Science TR94-239.
17. Flanagan, C. and Felleisen, M. (1995) The semantics of future and its use in program optimizations. Principles of Programming Languages, pp. 209-220.
18. Flanagan, C. and Nikhil, R. S. (1996) pHluid: The design of a parallel functional language implementation on workstations. International Conference on Functional Programming.
19. Gabriel, R. P. and McCarthy, J. (1988) Qlisp. Parallel Computation and Computers for Artificial Intelligence, pp. 63-89.
20. Halstead, R. (1985) Multilisp: A language for concurrent symbolic computataion. ACM Trans. Programming Languages and Systems, 7(4), 501-538.
21. Heintze, N. (1992) Set based program analysis. PhD thesis, Carnegie Mellon University.
22. Heintze, N. (1994) Set-based analysis of ML programs. Lisp and Functional Programming, pp. 306-317.
23. Henglein, F. (1992) Global tagging optimization by type inference. Lisp and Functional Programming, pp. 205-215.
24. Ito, T. and Halstead, R. H. (eds). (1989) Parallel Lisp: Languages and Systems: Lecture Notes in Computer Science 441. Springer-Verlag.
25. Ito, T. and Matsui, M. (1989) A parallel Lisp language: Pailisp and its kernel specification: Lecture Notes in Computer Science 441. Springer-Verlag, pp. 58-100.
26. Jagannathan, S. and Weeks, S. (1994) Analyzing stores and references in a parallel symbolic language. Lisp and Functional Programming, pp. 294-305.
27. Katz, M. and Weise, D. (1990) Continuing into the future: on the interaction of futures and first-class continuations. Lisp and Functional Programming.
28. Kessler, R. R. and Swanson, R. (1989) Concurrent scheme: Lecture Notes in Computer Science 441. S[pringer-Verlag, pp. 200-234.
29. Knopp, J. (1989) Improving the performance of parallel Lisp by compile time analysis: Lecture Notes in Computer Science 441. Springer-Verlag, pp. 271-277.
30. Kranz, D. A., Halstead, R. H. and Mohr, E. (1989) Mul-T: A high-performance parallel Lisp: Lecture Notes in Computer Science 441. Springer-Verlag, pp. 306-321.
31. Leroy, X. (1992) Typage polymorphe d'un langage algorithmique. PhD thesis, Université Paris 7.
32. Miller, J. (1987) Multischeme: A parallel processing system. PhD thesis, MIT.
33. Mohr, E., Kranz, R. and Halstead, R. (1990) Lazy task creation: A technique for increasing the granularity of parallel programs. Lisp and Functional Programming.
34. Moreau, L. (1994a) The PCKS-machine. an abstract machine for sound evaluation of parallel functional programs with first-class continuations. European Symposium on Programming (ESOP'94): Lecture Notes in Computer Science 788, pp. 424-438. Springer-Verlag.
35. Moreau, L. (1994b) Sound evaluation of parallel functional programs with first-class continuations. PhD thesis, Universite de Liege.
36. Moreau, L. (1996) The semantics of scheme with future. International Conference on Functional Programming, pp. 146-156.
37. Shivers, O. (1991) Control-flow analysis of higher-order languages, or taming lambda. PhD thesis, Carnegie-Mellon University.
38. Palsberg, J. and O'Keefe, P. (1995) A type system equivalent to flow analysis. Principles of Programming Languages, pp. 367-378.
39. Plotkin, G. D. (1975) Call-by-name, call-by-value, and the λ-calculus. Theor. Comput. Sci. 1, 125-159.
40. Reppy, J. H. (1992) Higher-order concurrency. PhD thesis, Cornell University.
41. Swanson, M. R., Kessler, R. R. & Lindstrom, G. (1988) An implementation of portable standard lisp on the BBN Butterfly. Lisp and Functional Programming, pp. 132-142.
42. Wand, M. (1995) Compiler correctness for parallel languages. Unpublished manuscript.
43. Wright, A. and Cartwright, R. (1994) A practical soft type system for scheme. Lisp and Functional Programming, pp. 250-262.