Static type inference in a dynamically typed language

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Static type inference in a dynamically typed language

Full text

Pdf (858 KB)

Source

Annual Symposium on Principles of Programming Languages archive
Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages table of contents

Orlando, Florida, United States

Pages: 279 - 290

Year of Publication: 1991

ISBN:0-89791-419-8

Authors

Alex Aiken	IBM Almaden Research Center, 650 Harry Rd., San Jose, CA
Brian Murphy	Computer Science Department, Stanford University, Stanford, CA

Sponsors

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

Publisher

ACM New York, NY, USA

Bibliometrics

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

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

	B*89	J. Backus et al. FL Language Manual, Parts 1 and 2. Research Report RJ 7100, IBM, 1989.
	Bac78	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]
	CC79	Patrick Cousot , Radhia Cousot, Systematic design of program analysis frameworks, Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, p.269-282, January 29-31, 1979, San Antonio, Texas [doi>10.1145/567752.567778]
	DM82	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]
	Fra81	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]
	GHW81	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]
	GS84	F. Gecseg and M. Steinby. Tree Automata. Academei Kaido, Budapest, 1984.
	HJ90	Nevin Heintze , Joxan Jaffar, A finite presentation theorem for approximating logic programs, Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.197-209, December 1989, San Francisco, California, United States [doi>10.1145/96709.96729]
	HMT89	R. Harper, R. Milner, and M. Tofte. The Definition of Standard ML--Version 3. Technical Report ECFS-LFCS-89-81, Laboratory for Foundation~ of Computc~ Science, Uniw~rsity of Edinburgh, 1989.
	HWA*88	P. Hudak, P. Wadler, Arvind, B. Boutet, 3. Fairbairn, J. Fasel, 3. Hughes, T. Johnsson, D. Kieburtz, S. P. Jones, R. Nikhil, M. Reeve, D. Wise~ and J. Young. ReFort on the Functional Programming Language Haskell. Technical P~eport DCS/RR-666, Yale University, December 1988.
	HY88	P. Hudak , J. Young, A collecting interpretation of expressions, Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.107-118, January 10-13, 1988, San Diego, California, United States [doi>10.1145/73560.73570]
	Kat84	Takuya Katayama, Type inference and type checking for functional programming languages: A reduced computation approach, Proceedings of the 1984 ACM Symposium on LISP and functional programming, p.263-272, August 06-08, 1984, Austin, Texas, United States [doi>10.1145/800055.802043]
	Mic68	D. Michie. 'Memo' functions and machine learning. Nature, (218):19-22, April 1968.
	Mil78	R. Milner. A theory of type polymorphism in programming. J. Comp. eJ Sys. Sci., 17:348-375, 1978.
	MR85	Prateek Mishra , Uday S. Reddy, Declaration-free type checking, Proceedings of the 12th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, p.7-21, January 14-16, 1985, New Orleans, Louisiana, United States [doi>10.1145/318593.318603]
	Mur90	B.R. Murphy. A Type inference System for FL. Master's thesis, MIT, 1990.
	Nie85	Flemming Nielson, Program transformations in a denotational setting, ACM Transactions on Programming Languages and Systems (TOPLAS), v.7 n.3, p.359-379, July 1985 [doi>10.1145/3916.3917]
	Plo	G.D. Plotkin. A structural approach to operational semantics. Text prepared at University of Aarhus.
	Tha88	Satish Thatte, Type Inference with Partial Types, Proceedings of the 15th International Colloquium on Automata, Languages and Programming, p.615-629, July 11-15, 1988
	YO88	J. Young and P. O'Keefe. Experience with a type evaluator. In D. Bjcrner, A. P. Ershov, and N. D. Jones, editors, Par- ~ial Evaluation and Mized Computation, pages 573-581, North-Holland, 1988.

CITED BY 14

	Fritz Henglein, Global tagging optimization by type inference, ACM SIGPLAN Lisp Pointers, v.V n.1, p.205-215, Jan. 1992
	Alexander Aiken , Manuel Fähndrich, Dynamic typing and subtype inference, Proceedings of the seventh international conference on Functional programming languages and computer architecture, p.182-191, June 26-28, 1995, La Jolla, California, United States
	Matthai Philipose , Craig Chambers , Susan J. Eggers, Towards automatic construction of staged compilers, ACM SIGPLAN Notices, v.37 n.1, p.113-125, Jan. 2002
	Mitchell Wand , Paul Steckler, Selective and lightweight closure conversion, Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.435-445, January 16-19, 1994, Portland, Oregon, United States
	Patrick Cousot , Radhia Cousot, Formal language, grammar and set-constraint-based program analysis by abstract interpretation, Proceedings of the seventh international conference on Functional programming languages and computer architecture, p.170-181, June 26-28, 1995, La Jolla, California, United States
	Alexander Aiken , Edward L. Wimmers , T. K. Lakshman, Soft typing with conditional types, Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.163-173, January 16-19, 1994, Portland, Oregon, United States
	Yanhong A. Liu , Scott D. Stoller, Eliminating dead code on recursive data, Science of Computer Programming, v.47 n.2-3, p.221-242, May 2003
	Witold Charatonik , Andreas Podelski, Set constraints with intersection, Information and Computation, v.179 n.2, p.213-229, December 15, 2002
	Robert Cartwright , Mike Fagan, Soft typing, ACM SIGPLAN Notices, v.26 n.6, p.278-292, June 1991
	Robert Cartwright , Mike Fagan, Soft typing, ACM SIGPLAN Notices, v.39 n.4, April 2004
	Thomas Reps, Undecidability of context-sensitive data-independence analysis, ACM Transactions on Programming Languages and Systems (TOPLAS), v.22 n.1, p.162-186, Jan. 2000
	P. Ørbæk , J. Palsberg, Trust in the λ-calculus, Journal of Functional Programming, v.7 n.6, p.557-591, November 1997
	Neil Mitchell , Colin Runciman, Not all patterns, but enough: an automatic verifier for partial but sufficient pattern matching, Proceedings of the first ACM SIGPLAN symposium on Haskell, September 25-25, 2008, Victoria, BC, Canada
	Mason Chang , Edwin Smith , Rick Reitmaier , Michael Bebenita , Andreas Gal , Christian Wimmer , Brendan Eich , Michael Franz, Tracing for web 3.0: trace compilation for the next generation web applications, Proceedings of the 2009 ACM SIGPLAN/SIGOPS international conference on Virtual execution environments, March 11-13, 2009, Washington, DC, USA