Concrete syntax for data objects in functional languages

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Concrete syntax for data objects in functional languages

Full text

Pdf (778 KB)

Source

Conference on LISP and Functional Programming archive
Proceedings of the 1988 ACM conference on LISP and functional programming table of contents

Snowbird, Utah, United States

Pages: 96 - 105

Year of Publication: 1988

ISBN:0-89791-273-X

Authors

Annika Aasa	Programming Methodology Group, Dept. of Computer Science, Univ. of Göteborg and Chalmers, S-412 96 Göteborg, Sweden
Kent Petersson	Programming Methodology Group, Dept. of Computer Science, Univ. of Göteborg and Chalmers, S-412 96 Göteborg, Sweden
Dan Synek	Programming Methodology Group, Dept. of Computer Science, Univ. of Göteborg and Chalmers, S-412 96 Göteborg, Sweden

Sponsors

SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
SIGART: ACM Special Interest Group on Artificial Intelligence
SIGPLAN: ACM Special Interest Group on Programming Languages

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 7, Downloads (12 Months): 18, Citation Count: 5

Additional Information:

references cited by index terms collaborative colleagues

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/62678.62688 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.

	AJ87	L. Augustsson and T. Johnsson. Lazy ML User's Manual. Programming Methodology Group, Department of Computer Sciences, Chalmers, S--412 96 GSteborg, Sweden, 1987. To be distributed with the LML corn.piler.
	Aug84	Lennart Augustsson, A compiler for lazy ML, Proceedings of the 1984 ACM Symposium on LISP and functional programming, p.218-227, August 06-08, 1984, Austin, Texas, United States [doi>10.1145/800055.802038]
	DKLM84	V. Donzeau-Gouge , G. Kahn , B. Lang , B. Mélèse, Document structure and modularity in mentor, Proceedings of the first ACM SIGSOFT/SIGPLAN software engineering symposium on Practical software development environments, p.141-148, April 1984
	Ear70	Jay Earley, An efficient context-free parsing algorithm, Communications of the ACM, v.13 n.2, p.94-102, Feb 1970 [doi>10.1145/362007.362035]
	FM88	You-Chin Fuh , Prateek Mishra, Type inference with subtypes, Proceedings of the Second European Symposium on Programming, p.155-175, January 1988, Nancy, France
	GMW79	M. Gordon, R. Milner, and C. Wadsworth. Edinburgh LCF. Volume 78 of Lecture Notes in Computer Science, Springer-Verlag, 1979.
	Gor79	Michael J. C. Gordon, The Denotational Description of Programming Languages: An Introduction, Springer-Verlag New York, Inc., Secaucus, NJ, 1979
	GTWW77	J. A. Goguen , J. W. Thatcher , E. G. Wagner , J. B. Wright, Initial Algebra Semantics and Continuous Algebras, Journal of the ACM (JACM), v.24 n.1, p.68-95, Jan. 1977 [doi>10.1145/321992.321997]
	Hoa75	C.A.R. Hoare. Recursive data structures. International Journal of Computer and Information Science,, 4(2):105- 132, 1975.
	Hue86	G. Huet. Formal structures for computation and deduction. May 1986. Lecture Notes for International Summer School on Logic Programming and Calculi of Discrete Design, Marktoberdorf, Germany.
	Lan64	P.J. Landin. The mechanical evaluation of expressions. Computer Journal, 6(4):308-320, 1964.
	Mil78	Robin Milner. A theory of type polymorphism in programming. Journal of Computer and Systems Sciences, 17:348-375, 1978.
	Mil84	R. Milner. Standard ML proposal. Polymor- Januaxy 1984.
	Pey86	Simon L. Peyton Jones, Parsing distfix operators, Communications of the ACM, v.29 n.2, p.118-122, Feb. 1986 [doi>10.1145/5657.5659]
	Pey87	Simon L. Peyton Jones, The Implementation of Functional Programming Languages (Prentice-Hall International Series in Computer Science), Prentice-Hall, Inc., Upper Saddle River, NJ, 1987
	Qui81	Willard Van Orman Quine. Mathematical Logic. Harward University Press, 1981.
	The85	The ML handbook, version 6.1. Project Formel, Inria, May 1985.
	Wan84	Mitchell Wand, A semantic prototyping system, Proceedings of the 1984 SIGPLAN symposium on Compiler construction, p.213-221, June 17-22, 1984, Montreal, Canada

CITED BY 5

	Michel Mauny, Parsers and printers as stream destructors and constructors embedded in functional languages, Proceedings of the fourth international conference on Functional programming languages and computer architecture, p.360-370, September 11-13, 1989, Imperial College, London, United Kingdom
	Annika Aasa, Precedences for conctypes, Proceedings of the conference on Functional programming languages and computer architecture, p.83-91, June 09-11, 1993, Copenhagen, Denmark
	Michel Mauny , Daniel de Rauglaudre, Parsers in ML, ACM SIGPLAN Lisp Pointers, v.V n.1, p.76-85, Jan. 1992
	Jonathan Riehl, Assimilating MetaBorg:: embedding language tools in languages, Proceedings of the 5th international conference on Generative programming and component engineering, October 22-26, 2006, Portland, Oregon, USA
	Jim Grundy , Tom Melham , John O'leary, A reflective functional language for hardware design and theorem proving, Journal of Functional Programming, v.16 n.2, p.157-196, March 2006