Safe polymorphic type inference for a dynamically typed language

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Safe polymorphic type inference for a dynamically typed language: translating Scheme to ML

Full text

Pdf (1.33 MB)

Source

Functional Programming Languages and Computer Architecture archive
Proceedings of the seventh international conference on Functional programming languages and computer architecture table of contents

La Jolla, California, United States

Pages: 192 - 203

Year of Publication: 1995

ISBN:0-89791-719-7

Authors

Fritz Henglein	DIKU, University of Copenhagen, Universitetsparken 1, DK-2100 Copenhagen East, Denmark
Jakob Rehof	DIKU, University of Copenhagen, Universitetsparken 1, DK-2100 Copenhagen East, Denmark

Sponsors

IFIP WG 2.8 : IFIP WG 2.8
SIGPLAN: ACM Special Interest Group on Programming Languages
SIGARCH: ACM Special Interest Group on Computer Architecture

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 3, Downloads (12 Months): 29, Citation Count: 8

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

	AW93	Alexander Aiken , Edward L. Wimmers, Type inclusion constraints and type inference, Proceedings of the conference on Functional programming languages and computer architecture, p.31-41, June 09-11, 1993, Copenhagen, Denmark [doi>10.1145/165180.165188]
	AWL94	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 [doi>10.1145/174675.177847]
	CC91	Felice Cardone , Mario Coppo, Type inference with recursive types: syntax and semantics, Information and Computation, v.92 n.1, p.48-80, May 1991 [doi>10.1016/0890-5401(91)90020-3]
	CF91	Robert Cartwright , Mike Fagan, Soft typing, Proceedings of the ACM SIGPLAN 1991 conference on Programming language design and implementation, p.278-292, June 24-28, 1991, Toronto, Ontario, Canada
	CR91	W. Cringer and J. Rees. Revised4 report on the algorithmic language scheme. A UM Lisp Pointers, IV, July-September 1991.
	Fag90	Mike Fagan, Soft typing: an approach to type checking for dynamically typed languages, Rice University, Houston, TX, 1992
	Hen92a	Fritz Henglein, Dynamic typing, Symposium proceedings on 4th European symposium on programming, p.233-253, January 1992, Rennes, France
	Hen92b	Fritz Henglein, Global tagging optimization by type inference, Proceedings of the 1992 ACM conference on LISP and functional programming, p.205-215, June 22-24, 1992, San Francisco, California, United States
	Hen92c	Fritz Henglein. Simple closure analysis. DIKU Semantics Report D-193, DIKU, University of Copenhagen, Universitetsparken 1, DK-2100 Copenhagen East, Denmark, March 1992.
	Hen94	Fritz Henglein, Dynamic typing: syntax and proof theory, Science of Computer Programming, v.22 n.3, p.197-230, June 1994
	HM95	Robert Harper , Greg Morrisett, Compiling polymorphism using intensional type analysis, Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.130-141, January 23-25, 1995, San Francisco, California, United States [doi>10.1145/199448.199475]
	Jon92	Mark P. Jones, A theory of qualified types, Symposium proceedings on 4th European symposium on programming, p.287-306, January 1992, Rennes, France
	Jon94	Mark P. Jones, ML Typing, Explicit Polymorphism and Qualified Types, Proceedings of the International Conference on Theoretical Aspects of Computer Software, p.56-75, April 19-22, 1994
	Reh95	Jakob Rehof. Polymorphic dynamic typing aspects of proof theory and inference. Master's thesis, DIKU, University of Copenhagen, March 1995.
	Shi91a	O. Shivers. Data-flow analysis and type recovery in Scheme. In P. Lee, editor, Topics in Advanced Language implementation, chapter 3, pages 47-88. MIT Press, 1991.
	Shi91b	Olin Grigsby Shivers, Control-flow analysis of higher-order languages of taming lambda, Carnegie Mellon University, Pittsburgh, PA, 1991
	Tha90	Satish Thatte, Quasi-static typing, Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.367-381, December 1989, San Francisco, California, United States [doi>10.1145/96709.96747]
	Tol94	Andrew Tolmach, Tag-free garbage collection using explicit type parameters, Proceedings of the 1994 ACM conference on LISP and functional programming, p.1-11, June 27-29, 1994, Orlando, Florida, United States
	WC94	Andrew K. Wright , Robert Cartwright, A practical soft type system for Scheme, Proceedings of the 1994 ACM conference on LISP and functional programming, p.250-262, June 27-29, 1994, Orlando, Florida, United States
	Wri94	Andrew Kevin Wright, Practical soft typing, Rice University, Houston, TX, 1996

CITED BY 8

	Andrew K. Wright , Robert Cartwright, A practical soft type system for scheme, ACM Transactions on Programming Languages and Systems (TOPLAS), v.19 n.1, p.87-152, Jan. 1997
	Andrew K. Wright , Suresh Jagannathan, Polymorphic splitting: an effective polyvariant flow analysis, ACM Transactions on Programming Languages and Systems (TOPLAS), v.20 n.1, p.166-207, Jan. 1998
	Mark Shields , Tim Sheard , Simon Peyton Jones, Dynamic typing as staged type inference, Proceedings of the 25th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.289-302, January 19-21, 1998, San Diego, California, United States
	Matthias Neubauer , Peter Thiemann, Discriminative sum types locate the source of type errors, ACM SIGPLAN Notices, v.38 n.9, p.15-26, September 2003
	Sam Tobin-Hochstadt , Matthias Felleisen, Interlanguage migration: from scripts to programs, Companion to the 21st ACM SIGPLAN conference on Object-oriented programming systems, languages, and applications, October 22-26, 2006, Portland, Oregon, USA
	Jacob Matthews , Robert Bruce Findler, Operational semantics for multi-language programs, ACM SIGPLAN Notices, v.42 n.1, January 2007
	Sam Tobin-Hochstadt , Matthias Felleisen, The design and implementation of typed scheme, ACM SIGPLAN Notices, v.43 n.1, January 2008
	Jacob Matthews , Robert Bruce Findler, Operational semantics for multi-language programs, ACM Transactions on Programming Languages and Systems (TOPLAS), v.31 n.3, p.1-44, April 2009