Properties of a Notation for Combining Functions

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Properties of a Notation for Combining Functions

Full text

Pdf (707 KB)

Source

Journal of the ACM (JACM) archive
Volume 30 , Issue 3 (July 1983) table of contents

Pages: 595 - 611

Year of Publication: 1983

ISSN:0004-5411

Authors

Jean-Claude Raoult	Laboratoire de Recherche en Informatique, Bâtiment 490, Université de Paris-Sud, Orsay, 91405 Orsay Cedex, France
Ravi Sethi	Bell Laboratories, Murray Hill, NJ

Publisher

ACM New York, NY, USA

Bibliometrics

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

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/2402.322393 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	ABDALI, S K An abstraction algorithm for combinatory logic. J. Symbolic Logic 4I,I (Mar. 1976), 222-224
	2	BACKUS, J.W., ET AL. The FORTRAN automatic coding system. Western Joint Computer Conf., Los Angeles, Calif, 1957, pp. 188-198.
	3	CURRY, H.B, AND FEYS, R. Combinatory Logic. North-Holland, Amsterdam, 1958.
	4	Michael J. C. Gordon, The Denotational Description of Programming Languages: An Introduction, Springer-Verlag New York, Inc., Secaucus, NJ, 1979
	5	F. Lockwood Morris, Advice on structuring compilers and proving them correct, Proceedings of the 1st annual ACM SIGACT-SIGPLAN symposium on Principles of programming languages, p.144-152, October 01-03, 1973, Boston, Massachusetts [doi>10.1145/512927.512941]
	6	MOSSES P.D. Abstract semantic algebrasr In Formal Description of Programming Concepts H (Prehm:nary Proceedings), D. Bjorner, Ed, North-Holland, Amsterdam, 1982, pp 63-88.
	7	Dennis Ritchie, The Evolution of the Unix Time-Sharing System, Proceedings of a Symposium on Language Design and Programming Methodology, p.25-36, September 10-11, 1979
	8	SCHONFINKEL, M. On the building blocks of mathematical logic. In From Frege to Godel, J van Heijenoort, Ed, Harvard University Press, Cambridge Mass., 1967, pp 355-366. Written up for pubhcatlon by H Behmann in March 1924 under the title, "Uber die Bausteme der mathemattschen Logik."
	9	Ravi Sethi, Control flow aspects of semantics directed compiling (Summary), Proceedings of the 1982 SIGPLAN symposium on Compiler construction, p.245-260, June 23-25, 1982, Boston, Massachusetts, United States
	10	THATCHER, J.W., WAGNER, E.G., AND WRIGHT, J B More on advice on structuring compilers and proving them correct. Theor. Comput Sci. 15 (1981), 223-249.
	11	TURNER D.A. A new implementation technique for applicative languages. Softw.- Pract. Exper. 9,1 (January 1979), 31--49.
	12	WAND, M.Different advice on structurmg compders and proving them correct. Tech. Rep. 95, Computer Science Dep, Indlana Univ., Bloomington I , Sept. 1980.
	13	Mitchell Wand, Deriving Target Code as a Representation of Continuation Semantics, ACM Transactions on Programming Languages and Systems (TOPLAS), v.4 n.3, p.496-517, July 1982 [doi>10.1145/357172.357179]

CITED BY 3

	Pascal Fradet , Daniel Le Métayer, Compilation of functional languages by program transformation, ACM Transactions on Programming Languages and Systems (TOPLAS), v.13 n.1, p.21-51, Jan. 1991
	Ravi Sethi, Control Flow Aspects of Semantics-Directed Compiling, ACM Transactions on Programming Languages and Systems (TOPLAS), v.5 n.4, p.554-595, Oct. 1983
	G. A. Venkatesh , Charles N. Fischer, SPARE: A Development Environment for Program Analysis Algorithms, IEEE Transactions on Software Engineering, v.18 n.4, p.304-318, April 1992