Primitive string transformations as reductions to normal form

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Primitive string transformations as reductions to normal form

Full text

Pdf (315 KB)

Source

ACM SIGPLAN Notices archive
Volume 25 , Issue 5 (May 1990) table of contents

Pages: 29 - 33

Year of Publication: 1990

ISSN:0362-1340

Author

Michael P. Barnett

Department of Computer and Information Science, Brooklyn College of the City University of New York, Bedford Avenue, Brooklyn, New York and The John von Neumann National Supercomputer Center, 665 College Road East, P.O. Box 3717, Princeton, New Jersey

Publisher

ACM New York, NY, USA

Bibliometrics

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

Additional Information:

references cited by collaborative colleagues

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/382080.382629 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	Michael P. Barnett, A simple mechanism that supports the prism language, ACM SIGPLAN Notices, v.20 n.12, p.5-12, Dec. 1985 [doi>10.1145/382086.382087]
	2	2. Barnett, M. P., Molecular Systems to Process Analog and Digital Data Associatively, in: [4], 229- 244.
	3	3. Pimental, G. C., Opportunities in Chemistry, 219-220. National Academy of Sciences, Washington, 1985.
	4	4. Carter, F. L., R. E. Siatkowski and H. Wohltjen (eds.), Molecular Electronic Devices, North-Holland Publishing, 1988.
	5	5. Barnett, M. P., The Molecular Basis of Cognition, Annual Report of the John von Neumann National Supercomputer Center, 33-38, 1988.
	6	M. P. Barnett, Continued operation notation for symbol manipulation and array processing, Communications of the ACM, v.6 n.8, p.467-472, Aug. 1963 [doi>10.1145/366707.367587]
	7	7. Barnett, M. P., A Chemical Model of Information Processing, MIT Solid State and Molecular Theory Group Quarterly Progress Report, 38, 87, 1961.
	8	8. Barnett, M. P., Comments Suggested by a Consideration of Computers, in: Schmitt, F. O. (ed.), Macromolecular Specificity and Biological Memory, 24-26, MIT Press, 1962.
	9	9. Curry, H. B. and Feys, R., Combinatory Logic, v. 1, North-Holland Publishing, Amsterdam, 1958.
	10	J. Roger Hindley , Jonathan P. Seldin, Introduction to combinators and &lgr;-calculus, Cambridge University Press, New York, NY, 1986
	11	11. Klop, J. W., Combinatory Reduction Systems, Mathematical Center Tracts no. 127, Mathematisch Centrum, Amsterdam, 1980.
	12	Richard B. Kieburtz, The g-machine: a fast, graph-reduction evaluator, Proc. of a conference on Functional programming languages and computer architecture, p.400-413, January 1985, Nancy, France
	13	John Backus, Can programming be liberated from the von Neumann style?: a functional style and its algebra of programs, Communications of the ACM, v.21 n.8, p.613-641, Aug. 1978 [doi>10.1145/359576.359579]
	14	Michael P. Barnett , Xu Rui, Infix to prefix conversion as a PST reduction, ACM SIGPLAN Notices, v.25 n.5, p.34-38, May 1990 [doi>10.1145/382080.382630]

CITED BY

Michael P. Barnett , Xu Rui, Infix to prefix conversion as a PST reduction, ACM SIGPLAN Notices, v.25 n.5, p.34-38, May 1990

Collaborative Colleagues:

Michael P. Barnett: colleagues

Adobe Acrobat

QuickTime

Windows Media Player

Real Player