research-article

A new concurrency model for Scala based on a declarative dataflow core

Authors:

Sébastien Doeraene,

Peter Van RoyAuthors Info & Claims

SCALA '13: Proceedings of the 4th Workshop on Scala

Article No.: 4, Pages 1 - 10

https://doi.org/10.1145/2489837.2489841

Published: 02 July 2013 Publication History

Abstract

Declarative dataflow values are single assignment variables such that all operations needing their values wait automatically until the values are available. Adding threads and declarative dataflow values to a functional language gives declarative concurrency, a model in which concurrency is deterministic and explicit synchronization is not needed. In our experience, this greatly simplifies the writing of concurrent programs (as explained in several chapters of CTM [20]). We complete this model with lazy execution and message-passing concurrency. Both extensions are tightly integrated with the declarative dataflow core. Lazy execution is provided by extending declarative dataflow with a by-need synchronization operation. Message passing is provided by adding streams equipped with a send operation, where a stream is a list with an unbound single-assignment variable. This paper presents the Ozma language, a conservative extension of Scala that supports all these concepts. We have made a complete implementation of Ozma by combining the implementations of Scala and Oz. Evaluation shows that this implementation supports the full semantics of Scala with concurrent programs based on the new concurrency model. In particular, within the functional subset of Scala the new concurrency model fully supports deterministic concurrency.

References

[1]

Arvind and Thomas R. E.: I-Structures: An efficient data type for functional languages. Technical Report 210, MIT, Laboratory for Computer Science, Cambridge, MA (1980)

[2]

Collet, R.: The Limits of Network Transparency in a Distributed Programming Language. PhD thesis, Université catholique de Louvain (2007)

[3]

Doeraene S.: Ozma: Extending Scala with Oz Concurrency. Master's thesis, Université catholique de Louvain. Full source code available at https://github.com/sjrd/ozma (2011)

[4]

Doeraene, S.: Ozma: Extending Scala with Oz Concurrency. Invited talk, Strange Loop, St Louis, MI, URL: thestrangeloop.com, (Sep. 2012)

[5]

Drejhammar, F., Schulte, C., Haridi, S., Brand, P.: Flow Java: Declarative concurrency for Java. In Proceedings of the Nineteenth International Conference on Logic Programming, Springer LNCS, vol. 2916, pp. 346--360. (2003)

[6]

Halstead, R. H. Jr.: MultiLisp: A language for concurrent symbolic computation. In ACM Transactions on Programming Languages and Systems, 7(4), pp. 501--538 (Oct. 1985)

Digital Library

[7]

Hewitt, C., Bishop P., Steiger, R.: A universal modular ACTOR formalism for artificial intelligence. In 3rd International Joint Conference on Artificial Intelligence (IJCAI), pp. 235--245 (Aug. 1973)

Digital Library

[8]

Imam, S., Sarkar, V.: Habanero-Scala: Async-Finish Programming in Scala.

[9]

Janson, S., Montelius, J., Haridi, S.: Ports for objects in concurrent logic programs. In Research Directions in Concurrent Object-Oriented Programming, pp. 211--231 (1993)

Digital Library

[10]

Kahn, G.: The semantics of a simple language for parallel programming. In IFIP Congress, pp. 471--475 (1974)

[11]

Odersky M.: Scala By Example. École Polytechnique Fédérale de Lausanne (2010)

[12]

Odersky M.: The Scala language specification, version 2.9. École Polytechnique Fédérale de Lausanne (2011)

[13]

Mozart Consortium: Mozart Programming System. URL: www.mozart-oz.org (2011)

[14]

Programming Methods Laboratory: The Scala Programming Language. URL: www.scala-lang.org (2011)

[15]

Rossberg, A.: Typed Open Programming: A Higher-Order, Typed Approach to Dynamic Modularity and Distribution. PhD thesis, Universität des Saarlandes (2007)

[16]

Saraswat, V. A.: Concurrent Constraint Programming. MIT Press, Cambridge, MA (1993)

Digital Library

[17]

Shapiro, E.: The family of concurrent logic programming languages. In ACM Computing Surveys, 21(3), pp. 413--510 (Sept. 1989)

Digital Library

[18]

Smolka, G.: The Oz programming model. In Computer Science Today, Springer LNCS, vol. 1000, pp. 324--343 (1995)

[19]

Spiessens, A., Collet, R., Van Roy, R.: Declarative Laziness in a Concurrent Constraint Language. In 2nd International Workshop on Multiparadigm Constraint Programming Languages, part of 9th International Conference on Principles and Practice of Constraint Programming (CP2003) (Sep. 2003)

[20]

Van Roy, P., Haridi, S.: Concepts, Techniques, and Models of Computer Programming. MIT Press, Cambridge MA (2004)

Digital Library

[21]

Van Roy, P.: Ozma: Extending Scala with Oz Concurrency. Invited talk, QCon International Software Development Conference, San Francisco, CA, URL: qconsf.com, (Nov. 2011)

Cited By

Allain CBour FClément BPottier FScherer G(2025)Tail Modulo Cons, OCaml, and Relational Separation LogicProceedings of the ACM on Programming Languages10.1145/37049159:POPL(2337-2363)Online publication date: 9-Jan-2025
https://dl.acm.org/doi/10.1145/3704915
Van Roy PHaridi SSchulte CSmolka G(2020)A history of the Oz multiparadigm languageProceedings of the ACM on Programming Languages10.1145/33863334:HOPL(1-56)Online publication date: 12-Jun-2020
https://dl.acm.org/doi/10.1145/3386333
Bravo MLi ZVan Roy PMeiklejohn CCastro LSvensson H(2014)DerflowProceedings of the Thirteenth ACM SIGPLAN workshop on Erlang10.1145/2633448.2633451(51-60)Online publication date: 3-Sep-2014
https://dl.acm.org/doi/10.1145/2633448.2633451
Show More Cited By

Index Terms

A new concurrency model for Scala based on a declarative dataflow core
1. Computing methodologies
  1. Concurrent computing methodologies
    1. Concurrent programming languages
2. Software and its engineering
  1. Software notations and tools
    1. General programming languages
      1. Language types
        Concurrent programming languages
        Data flow languages
        Distributed programming languages
        Parallel programming languages

Recommendations

WFR-TM

Transactional Memory (TM) is a promising concurrent programming paradigm which employs transactions to achieve synchronization in accessing common data known as transactional variables. A transaction may either commit, making its updates to ...
Reactive Async: expressive deterministic concurrency
SCALA 2016: Proceedings of the 2016 7th ACM SIGPLAN Symposium on Scala

Concurrent programming is infamous for its difficulty. An important source of difficulty is non-determinism, stemming from unpredictable interleavings of concurrent activities. Futures and promises are widely-used abstractions that help designing ...
Higher-order concurrency

Comments

Information & Contributors

Information

Published In

cover image ACM Other conferences

SCALA '13: Proceedings of the 4th Workshop on Scala

July 2013

84 pages

ISBN:9781450320641

DOI:10.1145/2489837

Copyright © 2013 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].

Sponsors

CNRS: Centre National De La Rechercue Scientifique
UM2: University Montpellier 2
AITO: Assoc Internationale por les Technologies Objects

In-Cooperation

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 02 July 2013

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Conference

ECOOP '13

Sponsor:

CNRS
UM2
AITO

ECOOP '13: European Conference on Object-Oriented Programming

July 2, 2013

Montpellier, France

Acceptance Rates

SCALA '13 Paper Acceptance Rate 12 of 22 submissions, 55%;

Overall Acceptance Rate 12 of 22 submissions, 55%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

4
Total Citations
View Citations
142
Total Downloads

Downloads (Last 12 months)2
Downloads (Last 6 weeks)0

Reflects downloads up to 09 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

Allain CBour FClément BPottier FScherer G(2025)Tail Modulo Cons, OCaml, and Relational Separation LogicProceedings of the ACM on Programming Languages10.1145/37049159:POPL(2337-2363)Online publication date: 9-Jan-2025
https://dl.acm.org/doi/10.1145/3704915
Van Roy PHaridi SSchulte CSmolka G(2020)A history of the Oz multiparadigm languageProceedings of the ACM on Programming Languages10.1145/33863334:HOPL(1-56)Online publication date: 12-Jun-2020
https://dl.acm.org/doi/10.1145/3386333
Bravo MLi ZVan Roy PMeiklejohn CCastro LSvensson H(2014)DerflowProceedings of the Thirteenth ACM SIGPLAN workshop on Erlang10.1145/2633448.2633451(51-60)Online publication date: 3-Sep-2014
https://dl.acm.org/doi/10.1145/2633448.2633451
Eriksen M(2014)Your server as a functionACM SIGOPS Operating Systems Review10.1145/2626401.262641348:1(51-57)Online publication date: 15-May-2014
https://doi.org/10.1145/2626401.2626413

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Figures

Tables

Media

View Table of Conten