Once upon a type

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Once upon a type

Full text

Pdf (1.20 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: 1 - 11

Year of Publication: 1995

ISBN:0-89791-719-7

Authors

David N. Turner	Computing Science Department, University of Glasgow, Glasgow G12 8QQ, Scotland
Philip Wadler	Computing Science Department, University of Glasgow, Glasgow G12 8QQ, Scotland
Christian Mossin	DIKU, University of Copenhagen, Universitetsparken 1, 2100 Copenhagen ø, 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): 51, Citation Count: 27

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.224168 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.

	AFMOW95	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]
	Aug93	Lennart Augustsson, Implementing Haskell overloading, Proceedings of the conference on Functional programming languages and computer architecture, p.65-73, June 09-11, 1993, Copenhagen, Denmark [doi>10.1145/165180.165191]
	Bak90	Henry G. Baker, Unify and conquer, Proceedings of the 1990 ACM conference on LISP and functional programming, p.218-226, June 27-29, 1990, Nice, France [doi>10.1145/91556.91652]
	BS93	Erik Barendsen , Sjaak Smetsers, Conventional and Uniqueness Typing in Graph Rewrite Systems, Proceedings of the 13th Conference on Foundations of Software Technology and Theoretical Computer Science, p.41-51, December 15-17, 1993
	CC94	S. A. Courtenage and C. D. Clack, Analysing resource use in the h-calculus by type inference, In A CM S,gplan Workshop on Partial Evaluat, on and Semantics. Based Program Manipulation, 1994.
	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]
	Gir87	Jean-Yves Girard, Linear logic, Theoretical Computer Science, v.50 n.1, p.1-102, Jan. 30, 1987 [doi>10.1016/0304-3975(87)90045-4]
	Gir93	J.-Y. Girard, On the unity of logic. Annals of Pure and Applied Logic, 59:201-217, 1993.
	GH90	J. Guzmln and P. Hudak, Single-threaded polymorphic lambda calculus. In Proceedings 5'th IEEE Symposium on Logic in Computer Science, Philadelphia, Pa., June 1990.
	GLP93	Andrew Gill , John Launchbury , Simon L. Peyton Jones, A short cut to deforestation, Proceedings of the conference on Functional programming languages and computer architecture, p.223-232, June 09-11, 1993, Copenhagen, Denmark [doi>10.1145/165180.165214]
	Hin69	R. Hindley, The principal type scheme of an object in combinatory logic. Trans. Am. Math. Sot., 146:29-60, December 1969.
	Hud86	Paul Hudak, A semantic model of reference counting and its abstraction (detailed summary), Proceedings of the 1986 ACM conference on LISP and functional programming, p.351-363, August 1986, Cambridge, Massachusetts, United States [doi>10.1145/319838.319876]
	Jon93	M. Jones, Partial evaluation for dictionary-free overloading. Technical report TR-959, Computer Science Department, Yale University, April 1993.
	JG91	Pierre Jouvelot , David Gifford, Algebraic reconstruction of types and effects, Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.303-310, January 21-23, 1991, Orlando, Florida, United States [doi>10.1145/99583.99623]
	Lau92	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
	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]
	Luc87	J.M. Lucassen, Types and effects, to/yards an integration of functional and imperative programming. PhD thesis, MIT Laboratory for Computer Science, 1987.
	LG88	J. M. Lucassen , D. K. Gifford, Polymorphic effect systems, Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.47-57, January 10-13, 1988, San Diego, California, United States [doi>10.1145/73560.73564]
	Mar93	S. Marlow, Update avoidance analysis by abstract interpretation. In Glasgow Workshop on Functional Programming, Ayr, July 1993. Springer Verlag Workshops in Computing Series.
	Mit84	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]
	Mit91	J. C. Mitchell, Type inference with simple subtypes. Journal of Funct,onal Programmzng, 1(3):245-286, July 1991.
	MOTW95	J. Maraist, M. Odersky, D. Turner, and P. Wadler. Call-by-name, call-by-value, call-by-need, and the linear lambda calculus. In 11'th International Conference on the Mathematical Foundations of Programming Semantics, New Orleans, Louisiana, April 1995.
	MTW95	C. Mossin, D.N. Turner, and P. Wadler, Once Upon A Type. Technical report, Computing Science Department, University of Glasgow, April 1995.
	MW92	Simon Marlow , Philip Wadler, Deforestation for Higher-Order Functions, Proceedings of the 1992 Glasgow Workshop on Functional Programming, p.154-165, July 06-08, 1992
	Pey92	S. Peyton Jones, Implementing lazy functional languages on stock hardware: the Spineless Tagless G- machine Journal of Functzonal Programming, 2(2):127- 202, April 1992.
	PHHPW93	S.L. Peyton Jones, C.V. Hall, K. Hammond, W.D. Partain, and P.L. Wadler, The Glasgow Haskell compiler: a technical overview. In Joint Framework for Information Technology (JFIT), Technical Conference Digest, March, 1993.
	PS94	S. Peyton Jones and A. Santos, Compilation by Transformation in the Glasgow Haskell Compiler. In Glasgow Workshop on Functional Programming, Ayr, September 1994. Springer Verlag Workshops in Computing Series.
	Rob65	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]
	Sch85	David A. Schmidt, Detecting global variables in denotational specifications, ACM Transactions on Programming Languages and Systems (TOPLAS), v.7 n.2, p.299-310, April 1985 [doi>10.1145/3318.3323]
	SP95	Patrick M. Sansom , Simon L. Peyton Jones, Time and space profiling for non-strict, higher-order functional languages, Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.355-366, January 23-25, 1995, San Francisco, California, United States [doi>10.1145/199448.199531]
	Wad90a	Philip Wadler, Deforestation: transforming programs to eliminate trees, Theoretical Computer Science, v.73 n.2, p.231-248, June 22, 1990
	Wad90b	P. Wadler, Linear types can change the world! In M. Broy and C. Jones, editors, Programming Concepts and Methods, Sea of Galilee, Israel, April 1990. North Holland, 1990.
	Wad91	Philip Wadler, Is there a use for linear logic?, Proceedings of the 1991 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation, p.255-273, June 17-19, 1991, New Haven, Connecticut, United States
	WB93	David A. Wright , Clement A. Baker-Finch, Usage Analysis with Natural Reduction Types, Proceedings of the Third International Workshop on Static Analysis, p.254-266, September 22-24, 1993

CITED BY 27

	David Walker , Kevin Watkins, On regions and linear types (extended abstract), ACM SIGPLAN Notices, v.36 n.10, October 2001
	David S. Wise , Joshua Walgenbach, Static and dynamic partitioning of pointers as links and threads, ACM SIGPLAN Notices, v.31 n.6, p.42-49, June 15, 1996
	David J. Roth , David S. Wise, One-bit counts between unique and sticky, ACM SIGPLAN Notices, v.34 n.3, p.49-56, March 1999
	Eijiro Sumii , Naoki Kobayashi, Online-and-offline partial evaluation (extended abstract): a mixed approach, ACM SIGPLAN Notices, v.34 n.11, p.12-21, Nov. 1999
	Atsushi Igarashi , Naoki Kobayashi, Resource usage analysis, ACM SIGPLAN Notices, v.37 n.1, p.331-342, Jan. 2002
	Naoki Kobayashi, Quasi-linear types, Proceedings of the 26th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.29-42, January 20-22, 1999, San Antonio, Texas, United States
	Keith Wansbrough , Simon Peyton Jones, Once upon a polymorphic type, Proceedings of the 26th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.15-28, January 20-22, 1999, San Antonio, Texas, United States
	Yasuhiko Minamide, A functional representation of data structures with a hole, Proceedings of the 25th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.75-84, January 19-21, 1998, San Diego, California, United States
	Jon Mountjoy, The spineless tagless G-machine, naturally, ACM SIGPLAN Notices, v.34 n.1, p.163-173, Jan. 1999
	Andrew Moran , David Sands, Improvement in a lazy context: an operational theory for call-by-need, Proceedings of the 26th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.43-56, January 20-22, 1999, San Antonio, Texas, United States
	Eijiro Sumii , Naoki Kobayashi, A Hybrid Approach to Online and Offline Partial Evaluation, Higher-Order and Symbolic Computation, v.14 n.2-3, p.101-142, September 2001
	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
	Naoki Kobayashi , Benjamin C. Pierce , David N. Turner, Linearity and the pi-calculus, Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.358-371, January 21-24, 1996, St. Petersburg Beach, Florida, United States
	Jörgen Gustavsson, A type based sharing analysis for update avoidance and optimisation, ACM SIGPLAN Notices, v.34 n.1, p.39-50, Jan. 1999
	Oukseh Lee , Kwangkeun Yi, Experiments on the effectiveness of an automatic insertion of memory reuses into ML-like programs, Proceedings of the 4th international symposium on Memory management, October 24-25, 2004, Vancouver, BC, Canada
	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
	Futoshi Iwama , Atsushi Igarashi , Naoki Kobayashi, Resource usage analysis for a functional language with exceptions, Proceedings of the 2006 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation, January 09-10, 2006, Charleston, South Carolina
	Oukseh Lee , Hongseok Yang , Kwangkeun Yi, Static insertion of safe and effective memory reuse commands into ML-like programs, Science of Computer Programming, v.58 n.1-2, p.141-178, October 2005
	Olin Shivers , Matthew Might, Continuations and transducer composition, ACM SIGPLAN Notices, v.41 n.6, June 2006
	J. Niehren , J. Schwinghammer , G. Smolka, A concurrent lambda calculus with futures, Theoretical Computer Science, v.364 n.3, p.338-356, 8 November 2006
	Tachio Terauchi , Alex Aiken, Witnessing side effects, ACM Transactions on Programming Languages and Systems (TOPLAS), v.30 n.3, p.1-42, May 2008
	John Maraist , Martin Odersky , Philip Wadler, The call-by-need lambda calculus, Journal of Functional Programming, v.8 n.3, p.275-317, May 1998
	Jurriaan Hage , Stefan Holdermans , Arie Middelkoop, A generic usage analysis with subeffect qualifiers, ACM SIGPLAN Notices, v.42 n.9, September 2007
	Kin-Keung Ma , Jeffrey S. Foster, Inferring aliasing and encapsulation properties for java, ACM SIGPLAN Notices, v.42 n.10, October 2007
	Koichi Kodama , Kohei Suenaga , Naoki Kobayashi, Translation of tree-processing programs into stream-processing programs based on ordered linear type1, Journal of Functional Programming, v.18 n.3, p.333-371, May 2008
	Akihiko Tozawa , Michiaki Tatsubori , Tamiya Onodera , Yasuhiko Minamide, Copy-on-write in the PHP language, Proceedings of the 36th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages, January 21-23, 2009, Savannah, GA, USA