Once upon a polymorphic type

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Once upon a polymorphic type

Full text

Pdf (1.82 MB)

Source

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

San Antonio, Texas, United States

Pages: 15 - 28

Year of Publication: 1999

ISBN:1-58113-095-3

Authors

Keith Wansbrough	Computing Laboratory, University of Cambridge, Cambridge CB2 3QG, England
Simon Peyton Jones	Microsoft Research Ltd., St George House, 1 Guildhall St, Cambridge CB2 3NH, England

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

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

	AC93	Roberto M. Amadio , Luca Cardelli, Subtyping recursive types, ACM Transactions on Programming Languages and Systems (TOPLAS), v.15 n.4, p.575-631, Sept. 1993 [doi>10.1145/155183.155231]
	ACM95	22nd A CM SIGPLAN-SIGA CT Symposium on Principles of Programming Languages (POPL'95), San Francisco, California, 1995. ACM Press.
	AFM+95	Zena M. Ariola , John Maraist , Martin Odersky , Matthias Felleisen , Philip Wadler, A call-by-need lambda calculus, Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.233-246, January 23-25, 1995, San Francisco, California, United States [doi>10.1145/199448.199507]
	BM98	Richard S. Bird , Lambert G. L. T. Meertens, Nested Datatypes, Proceedings of the Mathematics of Program Construction, p.52-67, June 15-17, 1998
	BS96	Erik Barendsen and Sjaak Smetsers. Uniqueness typing for functional languages with graph rewriting semantics. Mathematical Structures in Computer Science, 6:579-612, 1996.
	CG94	Pierre-Louis Curien , Giorgio Ghelli, Coherence of subsumption, minimum typing and type-checking in F≤, Theoretical aspects of object-oriented programming: types, semantics, and language design, MIT Press, Cambridge, MA, 1994
	Gil96	Andrew John Gill. Cheap Deforestation for Non- Strict Functional Languages. PhD thesis, University of Glasgow Department of Computing Science, January 1996.
	Gir95	Jean-Yves Girard, Linear logic: its syntax and semantics, Proceedings of the workshop on Advances in linear logic, p.1-42, June 1995
	Gol87	Benjamin Goldberg, Detecting sharing of partial applications in functional languages, Proc. of a conference on Functional programming languages and computer architecture, p.408-425, October 1987, Portland, Oregon, United States
	GT98	The GHC Team. The Glasgow Haskell Compiler user's guide, version 3.02. Distributed with GHC. Available http'//www.dcs .gla.ac. uk/fp/software/ ghc/, April 1998.
	Gus98	Jörgen Gustavsson, A type based sharing analysis for update avoidance and optimisation, Proceedings of the third ACM SIGPLAN international conference on Functional programming, p.39-50, September 26-29, 1998, Baltimore, Maryland, United States
	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]
	Jac94	Bart Jacobs. Semantics of weakening and contraction. Annals of Pure and Applied Logic, 69:73-106, 199.
	Lau93	John Launchbury, A natural semantics for lazy evaluation, Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.144-154, March 1993, Charleston, South Carolina, United States [doi>10.1145/158511.158618]
	LGH+92	John Launchbury , Andy Gill , John Hughes , Simon Marlow , Simon L. Peyton Jones , Philip Wadler, Avoiding Unnecessary Updates, Proceedings of the 1992 Glasgow Workshop on Functional Programming, p.144-153, July 06-08, 1992
	Lin92	Patrick Lincoln, Linear logic, ACM SIGACT News, v.23 n.2, p.29-37, Spring 1992 [doi>10.1145/130956.130958]
	Mar93	Simon Marlow. Update avoidance analysis by abstract interpretation. In Glasgow Workshop on Functional Programming, A yr, Springer Verlag Workshops in Computing Series, July 1993.
	Mog97	Torben Æ. Mogensen, Types for 0, 1 or Many Uses, Selected Papers from the 9th International Workshop on Implementation of Functional Languages, p.112-122, September 10-12, 1997
	Mog98	Torben }E. Mogensen. Types for 0, 1 or many uses. Updated and corrected version of {Mog97}. Obtained from author, 1998.
	Oka98	Chris Okasaki, Purely functional data structures, Cambridge University Press, New York, NY, 1998
	PJ92	Simon L. Peyton Jones. Implementing lazy functional languages on stock hardware: the Spineless Tagless G-machine. Journal of Functional Programming, 2(2):127-202, April 1992.
	PJ96	Simon L. Peyton Jones, Compiling Haskell by Program Transformation: A Report from the Trenches, Proceedings of the 6th European Symposium on Programming Languages and Systems, p.18-44, April 22-24, 1996
	PJL91a	Simon L. Peyton Jones , John Launchbury, Unboxed values as first class citizens in a non-strict functional language, Proceedings of the 5th ACM conference on Functional programming languages and computer architecture, p.636-666, June 1991, Cambridge, Massachusetts, United States
	PJL91b	Simon L. Peyton Jones , David Lester, A modular fully-lazy lambda lifter in HASKELL, Software—Practice & Experience, v.21 n.5, p.479-506, May 1991 [doi>10.1002/spe.4380210505]
	PJL92	Simon L. Peyton Jones , David R. Lester, Implementing functional languages, Prentice-Hall, Inc., Upper Saddle River, NJ, 1992
	PJPS96	Simon Peyton Jones , Will Partain , André Santos, Let-floating: moving bindings to give faster programs, Proceedings of the first ACM SIGPLAN international conference on Functional programming, p.1-12, May 24-26, 1996, Philadelphia, Pennsylvania, United States
	San95	Andr@ Luis de Mederios Santos. Compilation by Transformation in Non-Strict Functional Languages. PhD thesis, Department of Computing Science, University of Glasgow, July 1995. Available as Technical Report TR-1995-17.
	SP94	Martin Steffen and Benjamin Pierce. Higher-order subtyping. Technical Report LFCS-ECS-94-280, University of Edinburgh, February 1994. Also Universit/it Erlangen-Nfirnberg Interner Bericht IMMD7- 01/94. Revised version with Fun subtyping.
	TWM95a	David N. Turner , Philip Wadler , Christian Mossin, Once upon a type, Proceedings of the seventh international conference on Functional programming languages and computer architecture, p.1-11, June 26-28, 1995, La Jolla, California, United States [doi>10.1145/224164.224168]
	TWM95b	David N. Turner, Philip Wadler, and Christian Mossin. Once upon a type. Technical Report TR- 1995-8, Computing Science Department, University of Glasgow, 1995. Extended version of {TWM95a}. Available http://www, dcs. gla. ac. uk/pe ople / old-users/dnt/Mo s s inTurnerWadle rTR95, dvi. gz.
	Wad93	Philip Wadler, A Taste of Linear Logic, Proceedings of the 18th International Symposium on Mathematical Foundations of Computer Science, p.185-210, August 30-September 03, 1993
	Wel94	J.B. Wells. Typability and type checking in the second-order ,k-calculus are equivalent and undecidable. In Proc. 9th Ann. IEEE Symp. on Logic in Computer Science (LICS), pp. 176-185, Paris, 1994.
	WF94	Andrew K. Wright , Matthias Felleisen, A syntactic approach to type soundness, Information and Computation, v.115 n.1, p.38-94, Nov. 15, 1994 [doi>10.1006/inco.1994.1093]
	WPJ98	Keith Wansbrough and Simon Peyton Jones. Once upon a polymorphic type. Technical Report TR- 1998-19, Department of Computing Science, University of Glasgow, 1998.

CITED BY 13

	David Walker , Kevin Watkins, On regions and linear types (extended abstract), ACM SIGPLAN Notices, v.36 n.10, October 2001
	Atsushi Igarashi , Naoki Kobayashi, Resource usage analysis, ACM SIGPLAN Notices, v.37 n.1, p.331-342, Jan. 2002
	Olaf Chitil, Typer inference builds a short cut to deforestation, ACM SIGPLAN Notices, v.34 n.9, p.249-260, Sept. 1999
	Wei-Ngan Chin , Siau-Cheng Khoo , Dana N. Xu, Extending sized type with collection analysis, ACM SIGPLAN Notices, v.38 n.10, p.75-84, October 2003
	Atsushi Igarashi , Naoki Kobayashi, Resource usage analysis, ACM Transactions on Programming Languages and Systems (TOPLAS), v.27 n.2, p.264-313, March 2005
	Amal Ahmed , Matthew Fluet , Greg Morrisett, A step-indexed model of substructural state, ACM SIGPLAN Notices, v.40 n.9, September 2005
	Dana Harrington, Uniqueness logic, Theoretical Computer Science, v.354 n.1, p.24-41, 21 March 2006
	D. R. Ghica , A. S. Murawski , C.-H. L. Ong, Syntactic control of concurrency, Theoretical Computer Science, v.350 n.2, p.234-251, 7 February 2006
	Allyn Dimock , Ian Westmacott , Robert Muller , Franklyn Turbak , J. B. Wells, Functioning without closure: type-safe customized function representations for standard ML, ACM SIGPLAN Notices, v.36 n.10, October 2001
	Clara Segura , Carmen Torrano, Using Template Haskell for Abstract Interpretation, Electronic Notes in Theoretical Computer Science (ENTCS), 177, p.201-217, June, 2007
	Simon Peyton Jones , Simon Marlow, Secrets of the Glasgow Haskell Compiler inliner, Journal of Functional Programming, v.12 n.5, p.393-434, July 2002
	Jurriaan Hage , Stefan Holdermans , Arie Middelkoop, A generic usage analysis with subeffect qualifiers, ACM SIGPLAN Notices, v.42 n.9, September 2007
	Kung Chen , Jia-Yin Lin , Shu-Chun Weng , Siau-Cheng Khoo, Designing aspects for side-effect localization, Proceedings of the 2009 ACM SIGPLAN workshop on Partial evaluation and program manipulation, January 19-20, 2009, Savannah, GA, USA