Change search
Link to record
Permanent link

Direct link
BETA
Castegren, Elias, DoktorORCID iD iconorcid.org/0000-0003-4918-6582
Alternative names
Publications (3 of 3) Show all publications
Åkerblom, B., Castegren, E. & Wrigstad, T. (2019). Progress Report: Exploring API Design for Capabilities for Programming with Arrays. In: ECOOP 2019: . Paper presented at 14th Workshop on Implementation, Compilation, Optimization of Object-Oriented Languages, Programs and Systems, Mon 15 - Fri 19 July 2019 Hammersmith, London, United Kingdom.
Open this publication in new window or tab >>Progress Report: Exploring API Design for Capabilities for Programming with Arrays
2019 (English)In: ECOOP 2019, 2019Conference paper, Published paper (Refereed)
National Category
Computer Sciences
Identifiers
urn:nbn:se:kth:diva-257978 (URN)
Conference
14th Workshop on Implementation, Compilation, Optimization of Object-Oriented Languages, Programs and Systems, Mon 15 - Fri 19 July 2019 Hammersmith, London, United Kingdom
Note

QC 20190917

Available from: 2019-09-09 Created: 2019-09-09 Last updated: 2019-09-17Bibliographically approved
Castegren, E., Clarke, D., Fernandez-Reyes, K., Wrigstad, T. & Yang, A. M. (2018). Attached and detached closures in actors. In: AGERE 2018 - Proceedings of the 8th ACM SIGPLAN International Workshop on Programming Based on Actors, Agents, and Decentralized Control, co-located with SPLASH 2018: . Paper presented at 8th International Workshop on Programming based on Actors, Agents, and Decentralized Control, AGERE! 2018, co-located with SPLASH 2018, Boston, United States, 5 November 2018 through 5 November 2018 (pp. 54-61). Association for Computing Machinery (ACM)
Open this publication in new window or tab >>Attached and detached closures in actors
Show others...
2018 (English)In: AGERE 2018 - Proceedings of the 8th ACM SIGPLAN International Workshop on Programming Based on Actors, Agents, and Decentralized Control, co-located with SPLASH 2018, Association for Computing Machinery (ACM), 2018, p. 54-61Conference paper, Published paper (Refereed)
Abstract [en]

Expressive actor models combine aspects of functional programming into the pure actor model enriched with futures. Such functional features include first-class closures which can be passed between actors and chained on futures. Combined with mutable objects, this opens the door to race conditions. In some situations, closures may not be evaluated by the actor that created them yet may access fields or objects owned by that actor. In other situations, closures may be safely fired off to run as a separate task. This paper discusses the problem of who can safely evaluate a closure to avoid race conditions, and presents the current solution to the problem adopted by the Encore language. The solution integrates with Encore’s capability type system, which influences whether a closure is attached and must be evaluated by the creating actor, or whether it can be detached and evaluated independently of its creator. Encore’s current solution to this problem is not final or optimal. We conclude by discussing a number of open problems related to dealing with closures in the actor model.

Place, publisher, year, edition, pages
Association for Computing Machinery (ACM), 2018
Keywords
Closures, Concurrent programming, Parallel programming, Type systems
National Category
Computer Sciences
Identifiers
urn:nbn:se:kth:diva-241488 (URN)10.1145/3281366.3281371 (DOI)000458146800006 ()2-s2.0-85059003161 (Scopus ID)9781450360661 (ISBN)
Conference
8th International Workshop on Programming based on Actors, Agents, and Decentralized Control, AGERE! 2018, co-located with SPLASH 2018, Boston, United States, 5 November 2018 through 5 November 2018
Note

QC 20190123

Available from: 2019-01-23 Created: 2019-01-23 Last updated: 2019-02-22Bibliographically approved
Castegren, E. & Wrigstad, T. (2018). OOlong: A Concurrent Object Calculus for Extensibility and Reuse. ACM SIGAPP Applied Computing Review, 18(4), 47-60
Open this publication in new window or tab >>OOlong: A Concurrent Object Calculus for Extensibility and Reuse
2018 (English)In: ACM SIGAPP Applied Computing Review, ISSN 1559-6915, E-ISSN 1931-0161, Vol. 18, no 4, p. 47-60Article in journal (Refereed) Published
Abstract [en]

We present OOlong, an object calculus with interface inheritance, structured concurrency and locks. The goal of the calculus is extensibility and reuse. The semantics are therefore available in a version for LATEX typesetting (written in Ott), a mechanised version for doing rigorous proofs in Coq, and a prototype interpreter (written in OCaml) for typechecking an running OOlong programs.

Place, publisher, year, edition, pages
ACM Press, 2018
Keywords
Object Calculi, Semantics, Mechanisation, Concurrency
National Category
Computer Sciences
Identifiers
urn:nbn:se:kth:diva-243970 (URN)10.1145/3167132.3167243 (DOI)000456397300004 ()2-s2.0-85050541609 (Scopus ID)
Note

QC 20190221

Available from: 2019-02-21 Created: 2019-02-21 Last updated: 2019-02-21Bibliographically approved
Organisations
Identifiers
ORCID iD: ORCID iD iconorcid.org/0000-0003-4918-6582

Search in DiVA

Show all publications