The semantics of scheme with future

SIGPLAN Notices (ACM Special Interest Group on Programming Languages)

Volumn 31, Issue 6, 1996, Pages 146-156

  Moreau, Luc ^a  

^a UNIVERSITY OF SOUTHAMPTON   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 17144401878     PISSN: 03621340     EISSN: None     Source Type: Journal    
DOI: 10.1145/232629.232644     Document Type: Article

References (25)

1. Henry Baker and Carl Hewitt. The Incremental Garbage Collection of Processes. Technical Report AI Memo 454, M.I.T., Cambridge, Massachussets, March 1977.
2. Henk P. Barendregt. The Lambda Calculus: Its Syntax and Semantics, volume 103 of Studies in Logic and the Foundations of Mathematics. North-Holland, second edition, 1984.
3. Marc Feeley. An Efficient and General Implementation of Futures on Large Scale Shared-Memory Multiprocessors. PhD thesis, Brandeis University, 1993.
4. Matthias Felleisen and Daniel P. Friedman. Control Operators, the SECD-Machine and the λ-Calculus. In M. Wirsing, editor, Formal Description of Programming Concepts III, pages 193-217, Amsterdam, 1986. Elsevier Science Publishers B.V. (North-Holland).
5. Matthias Felleisen and Daniel P. Friedman. A Reduction Semantics for Imperative Higher-Order Languages. In Proc. Conf. on Parallel Architecture and Languages Europe, number 259 in Lecture Notes in Computer Science, pages 206-223. Springer-Verlag, 1987.
6. Matthias Felleisen and Robert Hieb. The Revised Report on the Syntactic Theories of Sequential Control and State. Theoretical Computer Science, 2(4):235-271, 1992. Technical Report 100, Rice University, June 1989.
7. Cormac Flanagan and Matthias Felleisen. The Semantics of Future and Its Use in Program Optimization. In Proceedings of the Twenty Second Annual ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages, January 1995. Technical Reports 238, 239, Rice University, 1994.
8. Robert H. Halstead, Jr. New Ideas in Parallel Lisp : Language Design, Implementation. In T. Ito and Robert H. Halstead, editors, Parallel Lisp : Languages and Systems. US/Japan Workshop on Parallel Lisp. Japan., number 441 in Lecture Notes in Computer Science, pages 2-57. Springer-Verlag, 1990.
9. Nevin Heintze. Set-Based Analysis of ML Programs. In Proceedings of the 1994 ACM Conference on Lisp and Functional Programming, pages 306-317, Orlando, Florida, June 1994.
10. Takayasu Ito and Manabu Matsui. A Parallel Lisp Language Pailisp and its Kernel Specification. In T. Ito and Robert H. Halstead, editors, Parallel Lisp : Languages and Systems. US/Japan Workshop on Parallel Lisp. Japan., number 441 in Lecture Notes in Computer Science, pages 58-100. Springer-Verlag, 1990.
11. Takayasu Ito and Tomohiro Seino. On Pailisp Continuation and its Implementation. In Proceedings of the ACM SIGPLAN workshop on Continuations CW92, pages 73-90, San Francisco, June 1992.
12. Morry Katz and Daniel Weise. Continuing Into the Future: On the Interaction of Futures and First-Class Continuations. In Proceedings of the 1990 ACM Conference on Lisp and Functional Programming, pages 176-184, June 1990.
13. James S. Miller. MultiScheme : A Parallel Processing System Based on MIT Scheme. PhD thesis, MIT, 1987.
14. Eric Mohr, David A. Kranz, and Robert H. Halstead. Lazy Task Creation : a Technique for Increasing the Granularity of Parallel Programs. In Proceedings of the 1990 ACM Conference on Lisp and Functional Programming, pages 185-197, June 1990.
15. Luc Moreau. The PCKS-machine. An Abstract Machine for Sound Evaluation of Parallel Functional Programs with First-Class Continuations. In European Symposium on Programming (ESOP'94), number 788 in Lecture Notes in Computer Science, pages 424-438, Edinburgh, Scotland, April 1994. Springer-Verlag.
16. Luc Moreau. Sound Evaluation of Parallel Functional Programs with First-Class Continuations. PhD thesis, University of Liège, Service d'Informatique, Institut Montefiore B28, 4000 Liège, Belgium, June 1994. Also available by anonymous ftp from ftp.montefiore.ulg.ac.be in directory pub/moreau.
17. Luc Moreau. Non-speculative and Upward Invocation of Continuations in a Parallel Language. In International Joint Conference on Theory and Practice of Software Development (TAPSOFT/FASE'95), number 915 in Lecture Notes in Computer Science, pages 726-740, Aarhus, Denmark, May 1995.
18. Luc Moreau. The Semantics of Scheme with Future. Technical report, University of Southampton, 1995.
19. Luc Moreau and Daniel Ribbens. The Semantics of pcall and fork. In R. Halstead, T. Ito, and C. Queinnec, editors, PSLS 95 - Parallel Symbolic Langages and Systems, Beaune, France, October 1995.
20. Christian Queinnec. DMEROON: a Distributed Class-based Causally-coherent Data Model: Preliminary Report. In Parallel Symbolic Languages and Systems., Beaune, France, October 1995.
21. Mukund Raghavachari and Anne Rogers. A Case Study in Language Support for Irregular Parallelism: Blocked Sparsed Cholesky. In Parallel Symbolic Languages and Systems., Beaune, France, October 1995.
22. 4 Report on the Algorithmic Language Scheme. Lisp Pointers, 4(3):1-55, July-September 1991.
23. Amr Sabry and Matthias Felleisen. Reasoning about Programs in Continuation-Passing Style. Lisp and Symbolic and Computation, Special Issue on Continuations, 6(3/4):289-360, November 1993.
24. Jean-Pierre Talpin and Pierre Jouvelot. Polymorphic Type, Region and Effect Inference. Journal of Functional Programming, 2(2), 1992.
25. Pete Tinker and Morry Katz. Parallel Execution of Sequential Scheme with ParaTran. In Proceedings of the 1988 ACM Conference on Lisp and Functional Programming, pages 28-39, Snowbird, Utah, July 1988.