A concurrent lambda calculus with futures

Theoretical Computer Science

Volumn 364, Issue 3, 2006, Pages 338-356

  Niehren, J ^a   Schwinghammer, J ^b   Smolka, G ^b  

^a INRIA   (France)

^b SAARLAND UNIVERSITY   (Germany)

Author keywords

Concurrency; Functional programming languages; Semantics

Indexed keywords

CONCURRENCY; FUNCTIONAL PROGRAMMING LANGUAGES; LAMBDA CALCULUS; SINGLE ASSIGNMENT ASSUMPTION;

ABSTRACTING; COMPUTER PROGRAMMING LANGUAGES; COMPUTER SCIENCE; ERROR ANALYSIS; SEMANTICS;

DIFFERENTIATION (CALCULUS);

EID: 33749612567     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2006.08.016     Document Type: Article

References (41)

1. Abadi M., and Lamport L. Conjoining specifications. ACM Trans. Programming Languages and Systems 17 3 (1995) 507-534
2. Ariola Z.M., and Felleisen M. The call-by-need lambda calculus. J. Funct. Programming 7 3 (1997) 265-301
3. Ariola Z.M., and Klop J.W. Lambda calculus with explicit recursion. Inform. and Comput. 139 2 (1997) 154-233
4. Arvind, Nikhil R.S., and Pingali K.K. I-structures: data structures for parallel computing. ACM Trans. Programming Languages and Systems 11 4 (1989) 598-632
5. Baker H., and Hewitt C. The incremental garbage collection of processes. ACM Sigplan Notices 12 (1977) 55-59
6. E. Barendsen, S. Smetsers, Uniqueness type inference, in: Proc. PLILP'95, Lecture Notes in Computer Science, Vol. 982, Springer, 1995, pp. 189-206.
7. G. Boudol, The π-calculus in direct style, in: 24th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 1997, pp. 228-241.
8. Caromel D., and Henrio L. A Theory of Distributed Objects (2005), Springer, Berlin
9. E. Chailloux, P. Manoury, B. Pagano, Developing Applications With Objective Caml, O'Reilly, 2000, available online at 〈http://caml.inria.fr/oreilly-book〉.
10. S. Conchon, 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.
11. Flanagan C., and Felleisen M. The semantics of future and an application. J. Funct. Programming 9 1 (1999) 1-31
12. Fournet C., and Gonthier G. The reflexive chemical abstract machine and the join-calculus. Proc. POPL'96 (1996), ACM Press, New York 372-385
13. C. Fournet, C. Laneve, L. Maranget, D. Rémy, Implicit typing à la ML for the join-calculus, in: Proceedings of the CONCUR'97, Lecture Notes in Computer Science, Vol. 1243, Springer, Berlin, 1997, pp. 196-212.
14. Halstead Jr. R.H. Multilisp: a language for concurrent symbolic computation. ACM Trans. Programming Languages and Systems 7 4 (1985) 501-538
15. Haridi S., Van Roy P., Brand P., Mehl M., Scheidhauer R., and Smolka G. Efficient logic variables for distributed computing. ACM Trans. Programming Languages and Systems 21 3 (1999) 569-626
16. Jeffrey A., and Rathke J. A fully abstract may testing semantics for concurrent objects. Proc. Lics 2002, 17th Annual Symposium on Logic in Computer Science (2002) 101-112
17. Jones S.P., Gordon A., and Finne S. Concurrent Haskell. Proc. POPL'96 (1996), ACM Press, New York 295-308
18. Kobayashi N., Pierce B.C., and Turner D.N. Linearity and the pi-calculus. ACM Trans. Programming Languages and Systems 21 5 (1999) 914-947
19. Landin P.J. The mechanical evaluation of expressions. Comput. J. 6 4 (1964) 308-320
20. Liskov B., and Shrira L. Promises: linguistic support for efficient asynchronous procedure calls in distributed systems. SIGPLAN Notices 23 7 (1988) 260-267
21. Maraist J., Odersky M., and Wadler P. The call-by-need lambda calculus. J. Funct. Programming 8 3 (1998) 275-317
22. R. Milner, The polyadic π-calculus: a tutorial, in: F.L. Bauer, W. Brauer, H. Schwichtenberg (Eds.), Logic and Algebra of Specification, Proc. Marktoberdorf Summer School, Springer, Berlin, 1993, pp. 203-246.
23. Milner R., Tofte M., Harper R., and MacQueen D.B. The Standard ML Programming Language (Revised) (1997), MIT Press, Cambridge, MA
24. Moreau L. The semantics of scheme with future. Internat. Conference on Functional Programming (1996), ACM Press, New York 146-156
25. M. Müller, Set-based failure diagnosis for concurrent constraint programming, Ph.D. Thesis, Saarland University, Saarbrücken, 1998.
26. Niehren J. Uniform confluence in concurrent computation. J. Funct. Programming 10 5 (2000) 453-499
27. J. Niehren, J. Schwinghammer, G. Smolka, A concurrent lambda calculus with futures, in: B. Gramlich (Ed.), Frontiers of Combining Systems, Lecture Notes in Artificial Intelligence, Vol. 3717, Springer, Berlin, 2005, pp. 248-263.
28. F. Nielson (Ed.), ML with Concurrency: Design, Analysis, Implementation, and Application, Monographs in Computer Science, Springer, Berlin, 1997.
29. Pierce B.C., and Turner D.N. Pict: a programming language based on the pi-calculus. In: Plotkin G., Stirling C., and Tofte M. (Eds). Proof, Language and Interaction: Essays in Honour of Robin Milner (2000), MIT Press, Cambridge, MA
30. Reppy J.H. Concurrent Programming in ML (1999), Cambridge University Press, Cambridge
31. A. Rossberg, Generativity and dynamic opacity for abstract types, in: Proc. Fifth Internat. ACM SIGPLAN Conference on Principles and Practice of Declarative Programming (PPDP'03), ACM Press, New York, 2003, pp. 241-252.
32. A. Rossberg, The missing link-dynamic components for ML, in: Eleventh International Conference on Fuctional Programming, ACM Press 2006.
33. A. Rossberg, D.L. Botlan, G. Tack, T. Brunklaus, G. Smolka, Alice through the looking glass, Trends in Functional Programming, Vol. 5, Intellect Books, Bristol, UK, Munich, Germany, 2006 pp. 77-96 (Chapter 6) (ISBN 1-84150144-1).
34. Saraswat V.A., Rinard M., and Panangaden P. Semantic foundations of concurrent constraint programming. Proc. POPL'91 (1991), ACM Press, New York 333-352
35. Shapiro E. The family of concurrent logic programming languages. ACM Comput. Surveys 21 3 (1989) 413-510
36. G. Smolka, The Oz programming model, in: J. van Leeuwen (Ed.), Computer Science Today, Lecture Notes in Computer Science, Vol. 1000, Springer, Berlin, 1995, pp. 324-343.
37. G. Tack, L. Kornstaedt, G. Smolka, Generic pickling and minimization, ENTCS 148 (2) (2006) 79-103.
38. The Alice Project, web site at the Programming Systems Lab, Saarland University 〈http://www.ps.uni-sb.de/alice〉, 2006.
39. Turner D.N., Wadler P., and Mossin C. Once upon a type. Proc. Seventh ICFPCA (1995), ACM Press, New York 1-11
40. P.Wadler, Linear types can change the world!, in: M.Broy, C.B. Jones(Eds.), Programming Concepts and Methods, 1990 North-Holland, Amsterdam, pp.546-566.
41. Wright A.K. Simple imperative polymorphism. Lisp and Symbolic Comput. 8 4 (1995) 343-355