Linear behaviour of term graph rewriting programs

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Linear behaviour of term graph rewriting programs

Full text

Pdf (895 KB)

Source

Symposium on Applied Computing archive
Proceedings of the 1995 ACM symposium on Applied computing table of contents

Nashville, Tennessee, United States

Pages: 157 - 163

Year of Publication: 1995

ISBN:0-89791-658-1

Authors

Richard Banach	CS Department, University of Manchester
George A. Papadopoulos	CS Department, University of Cyprus

Sponsors

SIGBIO: ACM Special Interest Group on Biomedical Computing
SIGADA: ACM Special Interest Group on Ada Programming Language
SIGCUE: ACM Special Interest Group on Computer Uses In Education
SIGICE: ACM Special Interest Group on Individual Computing Environment
SIGAPP: ACM Special Interest Group on Applied Computing
SIGPLAN: ACM Special Interest Group on Programming Languages

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 0, Downloads (12 Months): 4, Citation Count: 1

Additional Information:

references cited by index terms collaborative colleagues peer to peer

Tools and Actions:	Request Permissions 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/315891.315946 What 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.

	1	Richard Banach, Dataflow Analysis if Term Graph Rewriting Systems, Proceedings of the Parallel Architectures and Languages Europe, Volume II: Parallel Languages, p.55-72, June 12-16, 1989
	2	R. Banach, MONSTR i -- Fundamental Issues and the Design of MONSTR, submitted to New Generation Computing, 1993.
	3	R. Banach and G. A. Papadopoulos, Parallel Term Graph Rewriting and Concurrent Logic Programs, WP&DP'9$, Sofia, Bulgaria, 4~7 May, Bulgarian Academy of Sciences, pp. 303-322, North Holland (to appear).
	4	R. Banach , P. Watson, Dealing with state on FLAGSHIP: The MONSTR computational model, Proceedings of the conference on CONPAR 88, p.595-604, October 1989, UMIST, Manchester, United Kingdom
	5	H P Barendregt , M C J D Eekelen , J R W Glauert , J R Kennaway , M J Plasmeijer , M R Sleep, Term graph rewriting, Volume II: Parallel Languages on PARLE: Parallel Architectures and Languages Europe, p.141-158, March 1987, Eindhoven, The Netherlands
	6	I. Darlington, Y. Guo and M. K6hler, Functional Programming Languages with Logical Variables: A Linear Logic View, Internal Report, DOC, Imperial ' College, 1993.
	7	David Gelernter, Generative communication in Linda, ACM Transactions on Programming Languages and Systems (TOPLAS), v.7 n.1, p.80-112, Jan. 1985 [doi>10.1145/2363.2433]
	8	Jean-Yves Girard, Linear logic, Theoretical Computer Science, v.50 n.1, p.1-102, Jan. 30, 1987 [doi>10.1016/0304-3975(87)90045-4]
	9	J.R.W. Glauert, .I.R. Kennaway, M. R. Sleep and G. W. Somner, Final Specification of Dactl, Internal Report SYS-C88-11, University of East Anglia, Norwich, UK, 1988.
	10	K. Hammond, Parallel SML: A Functional Language and its Implementation in Dactl, Ph.D. Thesis, School of Information Systems, University of East Anglia, Norwich, UK, published by Pitman Publishers, 1990.
	11	J.A. Keane, An Overview of the Flagship System, Journal of Functional Programming, Vol. 4 (1), pp. 19-45, January 1994.
	12	Naoki Kobayashi , Akinori Yonezawa, ACL—a concurrent linear logic programming paradigm, Proceedings of the 1993 international symposium on Logic programming, p.279-294, December 1993, Vancouver, British Columbia, Canada
	13	George Angelos Papadopoulos, Parallel implementation of concurrent logic languages using graph rewriting techniques (logic languages), 1989
	14	Rinus Plasmeijer , Marko Van Eekelen, Functional Programming and Parallel Graph Rewriting, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1993
	15	V. Saraswat, A Brief Introduction to Linear Concurrent Constraint Programming, Technical Report, Xerox PAR. C, April, 1993.
	16	V. Saraswat and P. Lincoln, Higher Order, Linear, Concurrent Constraint Programming, Technical Report, Xerox PARC, July, 1992.
	17	Ehud Shapiro, The family of concurrent logic programming languages, ACM Computing Surveys (CSUR), v.21 n.3, p.413-510, Sep. 1989 [doi>10.1145/72551.72555]
	18	M. R. Sleep , M. J. Plasmeijer , M. C. J. D. van Eekelen, Term graph rewriting: theory and practice, John Wiley and Sons Ltd., Chichester, UK, 1993
	19	C.S.C. Tse, The Design and Implementation of an Actor Language Based on Linear Logic, Thesis Report, MIT, 1994.
	20	Paul Watson , Ian Watson, Evaluating functional programs on the FLAGSHIP machine, Proc. of a conference on Functional programming languages and computer architecture, p.80-97, October 1987, Portland, Oregon, United States
	21	I. Watson , V. Woods , P. Watson , R. Banach , M. Greenberg , J. Sargeant, Flagship: a parallel architecture for declarative programming, Proceedings of the 15th Annual International Symposium on Computer architecture, p.124-130, May 30-June 02, 1988, Honolulu, Hawaii, United States