Type inference and type checking for functional programming languages

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Type inference and type checking for functional programming languages: A reduced computation approach

Full text

Pdf (604 KB)

Source

Conference on LISP and Functional Programming archive
Proceedings of the 1984 ACM Symposium on LISP and functional programming table of contents

Austin, Texas, United States

Pages: 263 - 272

Year of Publication: 1984

ISBN:0-89791-142-3

Author

Takuya Katayama

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): 1, Downloads (12 Months): 14, 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/800055.802043 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	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]
	2	Luis Damas , Robin Milner, Principal type-schemes for functional programs, Proceedings of the 9th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.207-212, January 25-27, 1982, Albuquerque, Mexico [doi>10.1145/582153.582176]
	3	Geoffrey A. Frank, Specification of data structures for FP programs, Proceedings of the 1981 conference on Functional programming languages and computer architecture, p.221-228, October 18-22, 1981, Portsmouth, New Hampshire, United States [doi>10.1145/800223.806782]
	4	John Guttag , James Horning , John Williams, FP with data abstraction and strong typing, Proceedings of the 1981 conference on Functional programming languages and computer architecture, p.11-24, October 18-22, 1981, Portsmouth, New Hampshire, United States [doi>10.1145/800223.806758]
	5	Katayama,T., Type Inference and Type Checking for Functional Programming Languages, Tech. Rep. TR84-001, Department of Computer Science, University of North Carolina at Chapel Hill (1984).
	6	David MacQueen , Gordon Plotkin , Ravi Sethi, An ideal model for recursive polymorphic types, Proceedings of the 11th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, p.165-174, January 15-18, 1984, Salt Lake City, Utah, United States [doi>10.1145/800017.800528]
	7	Milner,R., A Theory of Type Polymorphism in Programming, JCSS 17 (1978) pp 348-375.
	8	John C. Mitchell, Coercion and type inference, Proceedings of the 11th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, p.175-185, January 15-18, 1984, Salt Lake City, Utah, United States [doi>10.1145/800017.800529]
	9	Morris,J.H., Lambda-Calculus Method of Programming Language, Ph.D. Thesis MAC-TR-57 MIT (1968).
	10	Reynolds,J.C., Automatic Computation of Data Set Definitions, Information Processing 68 (1969) pp 456-461.
	11	J. A. Robinson, A Machine-Oriented Logic Based on the Resolution Principle, Journal of the ACM (JACM), v.12 n.1, p.23-41, Jan. 1965 [doi>10.1145/321250.321253]
	12	Norihisa Suzuki, Inferring types in Smalltalk, Proceedings of the 8th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.187-199, January 26-28, 1981, Williamsburg, Virginia [doi>10.1145/567532.567553]
	13	Mitchell Wand, A types-as-sets semantics for milner-style polymorphism, Proceedings of the 11th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, p.158-164, January 15-18, 1984, Salt Lake City, Utah, United States [doi>10.1145/800017.800527]

CITED BY 5

	Alex Aiken , Brian Murphy, Static type inference in a dynamically typed language, Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.279-290, January 21-23, 1991, Orlando, Florida, United States
	R. Kent Dybvig , Bruce T. Smith, A semantic editor, ACM SIGPLAN Notices, v.18 n.6, p.74-82, June 1983
	Z. Zhang , K. M. George , G. E. Hedrick, A data flow approach to the evaluation of FP programs, Proceedings of the 1988 ACM sixteenth annual conference on Computer science, p.586-592, February 1988, Atlanta, Georgia, United States
	Thomas A. Sudkamp, Grammars for functional languages, Proceedings of the 1986 ACM fourteenth annual conference on Computer science, p.155-163, February 1986, Cincinnati, Ohio, United States
	Katsuro Inoue , Hiroyuki Seki , Hikaru Yagi, Analysis of functional programs to detect run-time garbage cells, ACM Transactions on Programming Languages and Systems (TOPLAS), v.10 n.4, p.555-578, Oct. 1988