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