Feedback
Beyond ML
Full text
Ps (58 KB)
Source
ACM Computing Surveys (CSUR) archiveVolume 28 , Issue 4es (December 1996) table of contentsSpecial issue: position statements on strategic directions in computing research
Article No. 172
Year of Publication: 1996
ISSN:0360-0300
Author
John Reynolds
Carnegie Mellon University
Publisher
ACM New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 1, Downloads (12 Months): 29, Citation Count: 0
Additional Information:
references collaborative colleagues peer to peer
Tools and Actions:
Review this Article Save this Article to a Binder Display Formats: BibTex EndNote ACM Ref
DOI Bookmark:
Use this link to bookmark this Article: http://doi.acm.org/10.1145/242224.242447What is a DOI?
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

Feedback
Higher-order concurrent programs with finite communication topology (extended abstract)
Full text
Pdf (1.09 MB)
Source
Annual Symposium on Principles of Programming Languages archiveProceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages table of contents
Portland, Oregon, United States
Pages: 84 - 97
Year of Publication: 1994
ISBN:0-89791-636-0
Authors
Hanne Riis Nielson
Computer Science Department, Aarhus University, Denmark
Flemming Nielson
Sponsors
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory SIGPLAN: ACM Special Interest Group on Programming Languages
Publisher
ACM New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 1, Downloads (12 Months): 11, Citation Count: 27
Additional Information:
abstract references cited by index terms collaborative colleagues peer to peer
Tools and Actions:
Review this Article Save this Article to a Binder Display Formats: BibTex EndNote ACM Ref
DOI Bookmark:
Use this link to bookmark this Article: http://doi.acm.org/10.1145/174675.174538What is a DOI?
ABSTRACT
Concurrent ML (CML) is an extension of the functional language Standard ML(SML) with primitives for the dynamic creation of processes and channels and for the communication of values over channels. Because of the powerful abstraction mechanisms the communication topology of a given program may be very complex and therefore an efficient implementation may be facilitated by knowledge of the topology. This paper presents an analysis for determining when a bounded number of processes and channels will be generated. The analysis proceeds in two stages. First we extend a polymorphic type system for SML to deduce not only the type of CML programs but also their communication behaviour expressed as terms in a new process algebra. Next we develop an analysis that given the communication behaviour predicts the number of processes and channels required during the execution of the CML program. The correctness of the analysis is proved using a subject reduction property for the type system.

Feedback
The definition of Standard ML


Source
Pages: 101
Year of Publication: 1990
ISBN:0-262-63132-6
Authors
Robin Milner
Univ. of Edinburgh, Edinburgh, Scotland, UK
Mads Tofte
Nsukka Univ., Nigeria
Robert Harper
Carnegie Mellon Univ., Pittsburgh, PA
Publisher
MIT Press Cambridge, MA, USA
Bibliometrics
Downloads (6 Weeks): n/a, Downloads (12 Months): n/a, Citation Count: 248
Additional Information:
cited by index terms review collaborative colleagues
Tools and Actions:
Review this Book Save this Book to a Binder Display Formats: BibTex EndNote ACM Ref
CITED BY 248

Alan Finlay , Lloyd Allison, Technical correspondence: a correction to the denotational semantics for the Prolog of Nicholson and Foo, ACM Transactions on Programming Languages and Systems (TOPLAS), v.15 n.1, p.206-208, Jan. 1993

Stephen Edwards , Luciano Lavagno , Edward A. Lee , Alberto Sangiovanni-Vincentelli, Design of embedded systems: formal models, validation, and synthesis, Readings in hardware/software co-design, Kluwer Academic Publishers, Norwell, MA, 2001

Lujo Bauer , Andrew W. Appel , Edward W. Felten, Mechanisms for secure modular programming in Java, Software—Practice & Experience, v.33 n.5, p.461-480, 25 April 2003

Robert Harper , Peter Lee, Research in programming languages for composability, safety, and performance, ACM Computing Surveys (CSUR), v.28 n.4es, Dec. 1996

Bruce J. McAdam, BigTypes in ML (poster), ACM SIGPLAN Notices, v.32 n.8, p.316, Aug. 1997

Riccardo Pucella, Review of proof, language, and interaction: essays in honour of Robin Milner edited by Plotkin, Stirling and Tofte, ACM SIGACT News, v.32 n.1, March 2001

Feedback
A parallel Lisp language PaiLisp and its kernel specification
Source
Proceedings of the US/Japan workshop on Parallel Lisp on Parallel Lisp: languages and systems table of contents
Sendai, Japan
Pages: 58 - 100
Year of Publication: 1990
ISBN:0-387-52782-6
Authors
T. Ito
M. Matsui
Publisher
Springer-Verlag New York, Inc. New York, NY, USA
Bibliometrics
Downloads (6 Weeks): n/a, Downloads (12 Months): n/a, Citation Count: 7
Additional Information:
cited by index terms collaborative colleagues
Tools and Actions:
Review this Article Save this Article to a Binder Display Formats: BibTex EndNote ACM Ref
CITED BY 7

Simon Marlow , Simon Peyton Jones , Andrew Moran , John Reppy, Asynchronous exceptions in Haskell, ACM SIGPLAN Notices, v.36 n.5, p.274-285, May 2001

Luc Moreau, The semantics of Scheme with future, ACM SIGPLAN Notices, v.31 n.6, p.146-156, June 15, 1996

Christian Queinnec, Locality, causality and continuations, ACM SIGPLAN Lisp Pointers, v.VII n.3, p.91-102, July-Sept. 1994

John Greiner , Guy E. Blelloch, A provably time-efficient parallel implementation of full speculation, Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.309-321, January 21-24, 1996, St. Petersburg Beach, Florida, United States

Susumu Nishimura , Atsushi Ohori, Parallel functional programming on recursively defined data via data-parallel recursion, Journal of Functional Programming, v.9 n.4, p.427-462, July 1999

John Greiner , Guy E. Blelloch, A provably time-efficient parallel implementation of full speculation, ACM Transactions on Programming Languages and Systems (TOPLAS), v.21 n.2, p.240-285, March 1999

Luc Moreau, A Syntactic Theory of Dynamic Binding, Higher-Order and Symbolic Computation, v.11 n.3, p.233-279, 1998
INDEX TERMS
Primary Classification: I. Computing Methodologies I.2 ARTIFICIAL INTELLIGENCE I.2.5 Programming Languages and Software Nouns: PaiLisp
Additional Classification: C. Computer Systems Organization C.1 PROCESSOR ARCHITECTURES C.1.3 Other Architecture Styles Subjects: Data-flow architectures D. Software D.1 PROGRAMMING TECHNIQUES D.2 SOFTWARE ENGINEERING D.3 PROGRAMMING LANGUAGES D.3.2 Language Classifications Nouns: SCHEME D.3.3 Language Constructs and Features Subjects: Procedures, functions, and subroutines I. Computing Methodologies I.1 SYMBOLIC AND ALGEBRAIC MANIPULATION I.2 ARTIFICIAL INTELLIGENCE
General Terms: Algorithms, Design, Experimentation, Languages, Performance
Collaborative Colleagues:
T. Ito: colleagues
M. Matsui: colleagues

Feedback
Asynchronous exceptions in Haskell
Full text
Pdf (1.47 MB)
Source
ACM SIGPLAN Notices archiveVolume 36 , Issue 5 (May 2001) table of contents
Pages: 274 - 285
Year of Publication: 2001
ISSN:0362-1340 Also published in ...
Authors
Simon Marlow
Microsoft Research, Cambridge
Simon Peyton Jones
Microsoft Research, Cambridge
Andrew Moran
Oregon Graduate Institute
John Reppy
Bell Labs, Lucent Technologies
Publisher
ACM New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 7, Downloads (12 Months): 73, Citation Count: 10
Additional Information:
abstract references cited by index terms collaborative colleagues peer to peer
Tools and Actions:
Review this Article Save this Article to a Binder Display Formats: BibTex EndNote ACM Ref
DOI Bookmark:
Use this link to bookmark this Article: http://doi.acm.org/10.1145/381694.378858What is a DOI?
ABSTRACT
Asynchronous exceptions, such as timeouts are important for robust, modular programs, but are extremely difficult to program with — so much so that most programming languages either heavily restrict them or ban them altogether. We extend our earlier work, in which we added synchronous exceptions to Haskell, to support asynchronous exceptions too. Our design introduces scoped combinators for blocking and unblocking asynchronous interrupts, along with a somewhat surprising semantics for operations that can suspend. Uniquely, we also give a formal semantics for our system.
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
Joe Armstrong , Robert Virding , Claes Wikström , Mike Williams, Concurrent programming in ERLANG (2nd ed.), Prentice Hall International (UK) Ltd., Hertfordshire, UK, 1996

2
Ken Arnold , James Gosling, The Java programming language (2nd ed.), ACM Press/Addison-Wesley Publishing Co., New York, NY, 1998

3
Paul S. Barth , Rishiyur S. Nikhil , Arvind Nikhil, M-structures: extending a parallel, non-strict, functional language with state, Proceedings of the 5th ACM conference on Functional programming languages and computer architecture, p.538-568, June 1991, Cambridge, Massachusetts, United States

Feedback
Concurrent programming in ERLANG (2nd ed.)


Source
Pages: 351
Year of Publication: 1996
ISBN:0-13-508301-X
Authors
Robert Virding
Ericsson Telecommunications Systems Labs, A¨lvsjo¨, Sweden
Claes Wikström
Ericsson Telecommunications Systems Labs, A¨lvsjo¨, Sweden
Mike Williams
Ericsson Telecommunications Systems Labs, A¨lvsjo¨, Sweden
Editors
Joe Armstrong
Ericsson Telecommunications Systems Labs, A¨lvsjo¨, Sweden
Publisher
Prentice Hall International (UK) Ltd. Hertfordshire, UK, UK
Bibliometrics
Downloads (6 Weeks): n/a, Downloads (12 Months): n/a, Citation Count: 91
Additional Information:
cited by index terms review collaborative colleagues
Tools and Actions:
Review this Book Save this Book to a Binder Display Formats: BibTex EndNote ACM Ref
CITED BY 91

John Hughes , Lars Pareto, Recursion and dynamic data-structures in bounded space: towards embedded ML programming, ACM SIGPLAN Notices, v.34 n.9, p.70-81, Sept. 1999

Peter Sewell , James J. Leifer , Keith Wansbrough , Francesco Zappa Nardelli , Mair Allen-Williams , Pierre Habouzit , Viktor Vafeiadis, Acute: high-level programming language design for distributed computation, ACM SIGPLAN Notices, v.40 n.9, September 2005

Peter Van Roy , Joe Armstrong , Matthew Flatt , Boris Magnusson, The role of language paradigms in teaching programming, ACM SIGCSE Bulletin, v.35 n.1, p.269-270, January 2003