swMATH9420MaRDI QIDQ21403FDOQ21403
Author name not available (Why is that?)
Official website: http://dl.acm.org/citation.cfm?doid=4472.4478
Cited In (56)
- Backwards type analysis of asynchronous method calls
- Oracle-guided scheduling for controlling granularity in implicitly parallel languages
- An assessment of Multilisp: Lessons from experience
- Dynamic structural operational semantics
- Functions as session-typed processes
- Functional programming with combinators
- An evaluation of interaction paradigms for active objects
- SC-net: A hybrid connectionist, symbolic system
- Asynchronous sequential processes
- Types for Proofs and Programs
- ASP\(_{\text{fun}}\) : a typed functional active object calculus
- Dependence analysis for safe futures
- Trends in trends in functional programming 1999/2000 versus 2007/2008
- Bounded quantifications for iteration and concurrency in logic programming
- Transparent fault tolerance for scalable functional computation
- On detecting over-eager concurrency in asynchronously communicating concurrent object systems
- Behavioral interface description of an object-oriented language with futures and promises
- A concurrent lambda calculus with futures
- Towards a \(\mathbb{K}\)ool future
- Toward a formal semantic framework for deterministic parallel programming
- On sessions and infinite data
- Controlling procedural modeling programs with stochastically-ordered sequential Monte Carlo
- Compositional reasoning about active objects with shared futures
- As-if-serial exception handling semantics for Java futures
- simpA
- ProActive
- Ivor
- Erlang
- A sound and complete reasoning system for asynchronous communication with shared futures
- Grace
- Alfalfa
- Camlflow
- Creol
- GUM
- iTasks
- Symgrid
- NESL
- GHC
- Java Jr
- ABS
- CUBIC
- JCobox
- PAL+
- Eden
- Terra
- JavAdaptor
- Welterweight Java
- ABCL
- AmbientTalk
- KOOL
- KeY-ABS
- Distributed Objects for Parallel Numerical Applications
- Efficient algorithms for parallel sorting on mesh multicomputers
- Continuation-based transformations for coordination languages
- A reduction semantics for direct-style asynchronous observables
- MULTILISP: a language for concurrent symbolic computation
This page was built for software: Multilisp
