Putting type annotations to work

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Putting type annotations to work

Full text

Pdf (1.20 MB)

Source

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

St. Petersburg Beach, Florida, United States

Pages: 54 - 67

Year of Publication: 1996

ISBN:0-89791-769-3

Authors

Martin Odersky	Department of Computer Science, University of Karlsruhe 76128 Karlsruhe, Germany
Konstantin Läufer	Department of Mathematical Sciences, Loyola University Chicago, Chicago, Illinois

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): 6, Downloads (12 Months): 34, Citation Count: 37

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

	Aug94	L. Augustsson. Haskell B. user's manual version 0.999.7, October 1994. Distributed with the HBC compiler.
	BMS80	R. M. Burstall , D. B. MacQueen , D. T. Sannella, HOPE: An experimental applicative language, Proceedings of the 1980 ACM conference on LISP and functional programming, p.136-143, August 25-27, 1980, Stanford University, California, United States [doi>10.1145/800087.802799]
	Boe89	H.-J. Boehm, Type inference in the presence of type abstraction, Proceedings of the ACM SIGPLAN 1989 Conference on Programming language design and implementation, p.192-206, June 19-23, 1989, Portland, Oregon, United States
	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]
	Fel90	M. Felleisen, On the expressive power of programming languages, Proceedings of the third European symposium on programming on ESOP '90, p.134-151, May 1990, Copenhagen, Denmark
	Gir71	J. Girard. Une extension de l'interpretation de GOdel a l'analyse, et son application a l'elimination des coupures dans l'anMyse et la theorie des types. In 2nd Scandznavian Logic Symp., pages 63-92, 1971.
	Hen93	Fritz Henglein, Type inference with polymorphic recursion, ACM Transactions on Programming Languages and Systems (TOPLAS), v.15 n.2, p.253-289, April 1993 [doi>10.1145/169701.169692]
	Jon92	Mark Philip Jones, Qualified types: theory and practice (ordering relation), 1992
	Jon95	Mark P. Jones. From Hindley-Milner types to first-class structures. In Proc. Hasketl Workshop, La Jolla, pages 1t5-136, June 1995. Yale University Research Report YALEU/DCS/RR-1075.
	KTU89	A. J. Kfoury , J. Tiuryn , P. Urzyczyn, The undecidability of the semi-unification problem, Proceedings of the twenty-second annual ACM symposium on Theory of computing, p.468-476, May 13-17, 1990, Baltimore, Maryland, United States [doi>10.1145/100216.100279]
	KTU93	A. J. Kfoury , J. Tiuryn , P. Urzyczyn, Type reconstruction in the presence of polymorphic recursion, ACM Transactions on Programming Languages and Systems (TOPLAS), v.15 n.2, p.290-311, April 1993 [doi>10.1145/169701.169687]
	LMM87	J.-L. Lassez , M. J. Maher , K. Marriott, Unification revisited, Foundations of deductive databases and logic programming, Morgan Kaufmann Publishers Inc., San Francisco, CA, 1988
	LO94	Konstantin Läfer , Martin Odersky, Polymorphic type inference and abstract data types, ACM Transactions on Programming Languages and Systems (TOPLAS), v.16 n.5, p.1411-1430, Sept. 1994 [doi>10.1145/186025.186031]
	LPar	John Launchbury , Simon L. Peyton Jones, State in Haskell, Lisp and Symbolic Computation, v.8 n.4, p.293-341, Dec. 1995 [doi>10.1007/BF01018827]
	McC84	Nancy McCracken, The typechecking of programs with implicit type structure., Proc. of the international symposium on Semantics of data types, p.301-315, July 1984, Sophia-Antipolis, France
	Mil78	Robin Milner. A theory of type polymorphism in programming. Journal of Computer and System Sciences, 17:348-375, Dec 1978.
	Mil92	Dale Miller, Unification under a mixed prefix, Journal of Symbolic Computation, v.14 n.4, p.321-358, Oct. 1992 [doi>10.1016/0747-7171(92)90011-R]
	Mit90	John C. Mitchell, Polymorphic type inference and containment, Logical foundations of functional programming, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1990
	Mor68	J.H. Morris. Lambda-Calculus Models of Programming Languages. PhD thesis, Massachusetts Institute of Technology, 1968. Technical Report MAC-TR-57.
	MP88	John C. Mitchell , Gordon D. Plotkin, Abstract types have existential type, ACM Transactions on Programming Languages and Systems (TOPLAS), v.10 n.3, p.470-502, July 1988 [doi>10.1145/44501.45065]
	MP93	M. Mauny and F. Pottier. An implementation of Carol-Light with existential types. Technical report, INRIA, October 1993. Distributed with the Caml-Light system.
	Myc84	Alan Mycroft, Polymorphic Type Schemes and Recursive Definitions, Proceedings of the 6th Colloquium on International Symposium on Programming, p.217-228, April 17-19, 1984
	OG89	James William O'Toole and David K. Gifford. Polymorphic type reconstruction. In Proceedings of the A CM SIGPLAN Conference on Programming Language Design and Implementation, pages 207-217. ACM, ACM Press, June 1989.
	OL95	Martin Odersky and Konstantin Laufer. Type reconstruction in the presence of type scheme annotations. Technical report, University of Karlsruhe, 1995. forthcoming.
	OWW95	Martin Odersky , Philip Wadler , Martin Wehr, A second look at overloading, Proceedings of the seventh international conference on Functional programming languages and computer architecture, p.135-146, June 26-28, 1995, La Jolla, California, United States [doi>10.1145/224164.224195]
	Per90	N. Perry. The Implementation of Practical Functional Programming Languages. P hD thesis, Imperial College of Science, Technology, and Medicine, University of London, 1990.
	Pfe88	Frank Pfenning, Partial polymorphic type inference and higher-order unification, Proceedings of the 1988 ACM conference on LISP and functional programming, p.153-163, July 25-27, 1988, Snowbird, Utah, United States [doi>10.1145/62678.62697]
	Rém89	D. Rémy, Type checking records and variants in a natural extension of ML, Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.77-88, January 11-13, 1989, Austin, Texas, United States [doi>10.1145/75277.75284]
	Rém94	Didier Rémy, Programming Objects with ML-ART, an Extension to ML with Abstract and Record Types, Proceedings of the International Conference on Theoretical Aspects of Computer Software, p.321-346, April 19-22, 1994
	Rey74	John C. Reynolds, Towards a theory of type structure, Programming Symposium, Proceedings Colloque sur la Programmation, p.408-423, April 09-11, 1974
	Wel94	J.B. Wells. Typability and type checking in the second order h-calculus are equivalent and undecidable. In Proc. 9th IEEE Symposium on Logic in Computer Science, pages 176-185, July 1994.

CITED BY 37

	Martin Odersky , Christoph Zenger , Matthias Zenger, Colored local type inference, ACM SIGPLAN Notices, v.36 n.3, p.41-53, March 2001
	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
	Koen Claessen , John Hughes, Testing monadic code with QuickCheck, Proceedings of the 2002 ACM SIGPLAN workshop on Haskell, p.65-77, October 03, 2002, Pittsburgh, Pennsylvania
	Zhe Yang, Encoding types in ML-like languages, ACM SIGPLAN Notices, v.34 n.1, p.289-300, Jan. 1999
	Dominic Duggan , Constantinos Sourelis, Mixin modules, ACM SIGPLAN Notices, v.31 n.6, p.262-273, June 15, 1996
	Didier Rémy , Jérôme Vouillon, Objective ML: a simple object-oriented extension of ML, Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.40-53, January 15-17, 1997, Paris, France
	Benjamin C. Pierce , David N. Turner, Local type inference, Proceedings of the 25th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.252-265, January 19-21, 1998, San Diego, California, United States
	Koji Kagawa, Compositional references for stateful functional programming, ACM SIGPLAN Notices, v.32 n.8, p.217-226, Aug. 1997
	Ralf Lämmel , Simon Peyton Jones, Scrap your boilerplate: a practical design pattern for generic programming, ACM SIGPLAN Notices, v.38 n.3, March 2003
	Benjamin C. Pierce , David N. Turner, Local type inference, ACM Transactions on Programming Languages and Systems (TOPLAS), v.22 n.1, p.1-44, Jan. 2000
	Andres Löh , Dave Clarke , Johan Jeuring, Dependency-style generic haskell, ACM SIGPLAN Notices, v.38 n.9, p.141-152, September 2003
	Koen Claessen , John Hughes, Testing monadic code with QuickCheck, ACM SIGPLAN Notices, v.37 n.12, December 2002
	Mark P. Jones, First-class polymorphism with type inference, Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.483-496, January 15-17, 1997, Paris, France
	Didier Le Botlan , Didier Rémy, ML^F: raising ML to the power of system F, ACM SIGPLAN Notices, v.38 n.9, p.27-38, September 2003
	Tim Sheard , Zine-el-abidine Benaissa , Emir Pasalic, DSL implementation using staging and monads, ACM SIGPLAN Notices, v.35 n.1, p.81-94, Jan. 2000
	Tim Sheard, Generic unification via two-level types and parameterized modules, ACM SIGPLAN Notices, v.36 n.10, October 2001
	Chung-chieh Shan, Sexy types in action, ACM SIGPLAN Notices, v.39 n.5, May 2004
	Zhe Yang, Encoding types in ML-like languages, Theoretical Computer Science, v.315 n.1, p.151-190, 5 May 2004
	Yuri Leontiev , M. Tamer Özsu , Duane Szafron, On type systems for object-oriented database programming languages, ACM Computing Surveys (CSUR), v.34 n.4, p.409-449, December 2002
	Vincent Simonet, An extension of HM(X) with bounded existential and universal data-types, ACM SIGPLAN Notices, v.38 n.9, p.39-50, September 2003
	Jeremy G. Siek , Jeremy Siek , Andrew Lumsdaine, Essential language support for generic programming, ACM SIGPLAN Notices, v.40 n.6, June 2005
	Claudio V. Russo, First-class structures for standard ML, Nordic Journal of Computing, v.7 n.4, p.348-374, Winter 2000
	Didier Rémy, Simple, partial type-inference for System F based on type-containment, ACM SIGPLAN Notices, v.40 n.9, September 2005
	Tim Sheard , Zine-el-abidine Benaissa , Emir Pasalic, DSL implementation using staging and monads, Proceedings of the 2nd conference on Conference on Domain-Specific Languages, p.7-7, October 03-05, 1999, Austin, Texas
	Vincent Simonet , François Pottier, A constraint-based approach to guarded algebraic data types, ACM Transactions on Programming Languages and Systems (TOPLAS), v.29 n.1, p.1-es, January 2007
	Dimitrios Vytiniotis , Stephanie Weirich , Simon Peyton Jones, Boxy types: inference for higher-rank types and impredicativity, ACM SIGPLAN Notices, v.41 n.9, September 2006
	Stephanie Weirich, RepLib: a library for derivable type classes, Proceedings of the 2006 ACM SIGPLAN workshop on Haskell, September 17-17, 2006, Portland, Oregon, USA
	Stephanie Weirich, Type-safe run-time polytypic programming, Journal of Functional Programming, v.16 n.6, p.681-710, November 2006
	Simon Peyton Jones , Dimitrios Vytiniotis , Stephanie Weirich , Mark Shields, Practical type inference for arbitrary-rank types, Journal of Functional Programming, v.17 n.1, p.1-82, January 2007
	Tim Sheard , Emir Pasalic, Two-level types and parameterized modules, Journal of Functional Programming, v.14 n.5, p.547-587, September 2004
	Stephanie Weirich, Type-FUNCTIONAL PEARL safe cast, Journal of Functional Programming, v.14 n.6, p.681-695, November 2004
	Daan Leijen, Flexible types: robust type inference for first-class polymorphism, Proceedings of the 36th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages, January 21-23, 2009, Savannah, GA, USA
	Daan Leijen, A type directed translation of MLF to system F, ACM SIGPLAN Notices, v.42 n.9, September 2007
	Bruno C.d.S. Oliveira , Jeremy Gibbons, Scala for generic programmers, Proceedings of the ACM SIGPLAN workshop on Generic programming, September 20-20, 2008, Victoria, BC, Canada
	Dimitrios Vytiniotis , Stephanie Weirich , Simon Peyton Jones, FPH: first-class polymorphism for Haskell, ACM SIGPLAN Notices, v.43 n.9, September 2008
	Daan Leijen, HMF: simple type inference for first-class polymorphism, ACM SIGPLAN Notices, v.43 n.9, September 2008
	Didier Le Botlan , Didier Rémy, Recasting MLF, Information and Computation, v.207 n.6, p.726-785, June, 2009