A concurrent lambda calculus with futures

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

Volumn 3717 LNAI, Issue , 2005, Pages 248-263

  Niehren, Joachim ^a   Schwinghammer, Jan ^b   Smolka, Gert ^b  

^a INRIA   (France)

^b SAARLAND UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

CODES (STANDARDS); COMPUTER PROGRAMMING LANGUAGES; LINEAR SYSTEMS; MATHEMATICAL MODELS;

CONCURRENT EXTENSION; LAMBDA CALCULUS; SEMAPHORES;

COMPUTATION THEORY;

EID: 33644887827     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11559306_14     Document Type: Conference Paper

References (27)

1. M. Abadi and L. Lamport. Conjoining specifications. ACM Transactions on Programming Languages and Systems, 17(3):507-534, 1995.
2. The Alice Project. Web site at the Programming Systems Lab, Universität des Saarlandes, http://www.ps.uni-sb.de/alice, 2005.
3. Z. M. Ariola and M. Felleisen. The call-by-need lambda calculus. Journal of Functional Programming, 7(3):265-301, 1997.
4. Arvind, R. S. Nikhil, and K. K. Pingali. I-structures: Data structures for parallel computing. ACM Transactions on Programming Languages and Systems, 11(4):598-632, 1989.
5. H. Baker and C. Hewitt. The incremental garbage collection of processes. ACM Sigplan Notices, 12:55-59, Aug. 1977.
6. E. Barendsen and S. Smetsers. Uniqueness type inference. In Proc. PLILP'95, volume 982 of LNCS, pages 189-206, Springer, 1995.
7. E. Chailloux, P. Manoury, and B. Pagano. Developing Applications With Objective Caml. O'Reilly, 2000. Available online at http://caml.inria.fr/ oreilly-book.
8. S. Conchon and F. L. Fessant. Jocaml: Mobile agents for Objective-Caml. In First International Symposium on Agent Systems and Applications (ASA '99)/Third International Symposium on Mobile Agents (MA '99), 1999.
9. C. Flanagan and M. Felleisen. The semantics of future and an application. Journal of Functional Programming, 9(1):1-31, 1999.
10. C. Fournet and G. Gonthier. The reflexive chemical abstract machine and the join-calculus. In Proc. POPL'96, pages 372-385. ACM Press, 1996.
11. C. Fournet, C. Laneve, L. Maranget, and D. Rémy. Implicit typing à la ML for the join-calculus. In Proc. CONCUR'97, volume 1243 of LNCS, pages 196-212. Springer, 1997.
12. R. H. Halstead, Jr. Multilisp: A Language for Concurrent Symbolic Computation. ACM Transactions on Programming Languages and Systems, 7(4):501-538, 1985.
13. S. Haridi, P. V. Roy, P. Brand, M. Mehl, R. Scheidhauer, and G. Smolka. Efficient logic variables for distributed computing. ACM Transactions on Programming Languages and Systems, 21 (3):569-626, 1999.
14. B. Liskov and L. Shrira. Promises: Linguistic support for efficient asynchronous procedure calls in distributed systems. SIGPLAN Notices, 23(7):260-268, 1988.
15. J. Maraist, M. Odersky, and P. Wadler. The call-by-need lambda calculus. Journal of Functional Programming, 8(3):275-317, 1998.
16. R. Milner. The polyadic π-calculus: A tutorial. In F. L. Bauer, W. Brauer, and H. Schwichtenberg, editors, Logic and Algebra of Specification, Proc. Marktoberdorf Summer School, pages 203-246. Springer, 1993.
17. R. Milner, M. Tofte, R. Harper, and D. B. MacQueen. The Standard ML Programming Language (Revised). MIT Press, 1997.
18. M. Müller. Set-based Failure Diagnosis for Concurrent Constraint Programming. PhD thesis, Universität des Saarlandes, Saarbrücken, 1998.
19. J. Niehren. Uniform confluence in concurrent computation. Journal of Functional Programming, 10(5):453-499, 2000.
20. F. Nielson, editor. ML with Concurrency: Design, Analysis, Implementation, and Application. Monographs in Computer Science. Springer, 1997.
21. B. C. Pierce and D. N. Turner. Pict: A programming language based on the picalculus. In G. Plotkin, C. Stirling, and M. Tofte, editors, Proof, Language and Interaction: Essays in Honour of Robin Milner. MIT Press, 2000.
22. J. H. Reppy. Concurrent Programming in ML. Cambridge University Press, 1999.
23. A. Rossberg, D. L. Botlan, G. Tack, T. Brunklaus, and G. Smolka. Alice Through the Looking Glass, volume 5 of Trends in Functional Programming. Intellect, Munich, Germany, 2004.
24. V. A. Saraswat, M. Rinard, and P. Panangaden. Semantic foundations of concurrent constraint programming. In Proc. POPL'91, pages 333-352. ACM Press.
25. E. Shapiro. The family of concurrent logic programming languages. ACM Comput. Surv., 21(3):413-510, 1989.
26. G. Smolka. The Oz programming model. In J. van Leeuwen, editor, Computer Science Today, volume 1000 of LNCS, pages 324-343. Springer, 1995.
27. D. N. Turner, P. Wadler, and C. Mossin. Once upon a type. In Proc. 7th ICFPCA, pages 1-11. ACM Press, 1995.