ABCL/f: A future-based polymorphic typed concurrent object-oriented language-Its design and implementation
Kenjiro Taura, Satoshi Matsuoka, Akinori Yonezawa · DIMACS series in discrete mathematics and theoretical computer science · 1994
Introduction Our new language ABCL/f , which is a descendant of ABCL/1 [12], is an explicit parallel language and based on a notion of concurrent objects. Unlike the original ABCL/1, however, it is not monolithically concurrent object-based. It allows usual function/procedure invocations as well as method invocations. One of the major difficulties in parallel programming is safe and efficient access to shared mutable data structures. In order to alleviate this difficulty, our language enforces programmers to define classes of concurrent object in order to use and encapsulate shared mutable data structures. Immutable data structures, however, are defined as ordinary data types and need not be defined as concurrent objects. The fundamental reason to write parallel programs is to exploit parallelism not only for more computational power, but also for fast, yet natural problem solving. Our language is intended to be u