Using parameterized signatures to express modular structure

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Using parameterized signatures to express modular structure

Full text

Pdf (1.15 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: 68 - 78

Year of Publication: 1996

ISBN:0-89791-769-3

Author

Mark P. Jones

Department of Computer Science, University of Nottingham, University Park, Nottingham NG7 2RD, 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): 5, Downloads (12 Months): 31, Citation Count: 15

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

	1	Maria Virginia Aponte, Extending record typing to type parametric modules with sharing, Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.465-478, March 1993, Charleston, South Carolina, United States [doi>10.1145/158511.158704]
	2	Andrew W. Appel , David B. MacQueen, Separate compilation for Standard ML, Proceedings of the ACM SIGPLAN 1994 conference on Programming language design and implementation, p.13-23, June 20-24, 1994, Orlando, Florida, United States
	3	Sandip K. Biswas, Higher-order functors with transparent signatures, Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.154-163, January 23-25, 1995, San Francisco, California, United States [doi>10.1145/199448.199478]
	4	Luca Cardelli and Xavier Leroy. Abstract types and the dot notation. Technical Report report 56, DEC S RC, 1990.
	5	Luca Cardelli , Peter Wegner, On understanding types, data abstraction, and polymorphism, ACM Computing Surveys (CSUR), v.17 n.4, p.471-523, Dec. 1985 [doi>10.1145/6041.6042]
	6	Robert Harper , Mark Lillibridge, A type-theoretic approach to higher-order modules with sharing, Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.123-137, January 16-19, 1994, Portland, Oregon, United States [doi>10.1145/174675.176927]
	7	Robert Harper , John C. Mitchell , Eugenio Moggi, Higher-order modules and the phase distinction, Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.341-354, December 1989, San Francisco, California, United States [doi>10.1145/96709.96744]
	8	Thomas Johnsson, Lambda lifting: transforming programs to recursive equations, Proc. of a conference on Functional programming languages and computer architecture, p.190-203, January 1985, Nancy, France
	9	Mark P. Jones. Quahfied Types: Theory and Prachce. PhD tl#esis, Programming Research Group, Oxford UiLiversity Computing Laboratory, July 1992. Published by Cambridge University Press, November 1994.
	10	5,.lark P. Jones. A system of constructor classes: overloading and implicit higher-order polymorphism. Jour. hal of Functional Programming, 5(1), J#nuary 1995.
	11	Stefan Kahrs, First-Class Polymorphism for ML, Proceedings of the 5th European Symposium on Programming: Programming Languages and Systems, p.333-347, April 11-13, 1994
	12	Iionstantin L'Xufer and Martin Odersky. An extension of ML with first-class abstract types. In A CM SIGPLAN Workshop on ML and its Applications, San Francisco, June 1992.
	13	Xavier Leroy, Manifest types, modules, and separate compilation, Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.109-122, January 16-19, 1994, Portland, Oregon, United States [doi>10.1145/174675.176926]
	14	Xavier Leroy. A syntactic theory of type generativity and sharing. In Record of the 199,4 A CM SIGPLAN IVorkshop on ML and its Applications, Orlando, FL, J une 1994.
	15	Xavier Leroy, Applicative functors and fully transparent higher-order modules, Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.142-153, January 23-25, 1995, San Francisco, California, United States [doi>10.1145/199448.199476]
	16	David B. MacQueen, Using dependent types to express modular structure, Proceedings of the 13th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, p.277-286, January 01, 1986, St. Petersburg Beach, Florida [doi>10.1145/512644.512670]
	17	David B. MacQueen , Mads Tofte, A Semantics for Higher-Order Functors, Proceedings of the 5th European Symposium on Programming: Programming Languages and Systems, p.409-423, April 11-13, 1994
	18	Per Mart in-Lgf. Constructive mathematics and computer programming. In Logic, Methodology and Philosophy of Sczence, VI. North Holland, Amsterdam, 1982.
	19	R. Militer. A theory of type polymorphism in programruing. Journal of Computer and System Sciences, 17(3), 1978.
	20	Robin hlilner. Mads Torte, and Robert Harper. The defiI#iho'n of Standard ML. The MIT Press, 1990.
	21	J. C. Mitchell , R. Harper, The essence of ML, Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.28-46, January 10-13, 1988, San Diego, California, United States [doi>10.1145/73560.73563]
	22	John Mitchell , Sigurd Meldal , Neel Madhav, An extension of standard ML modules with subtyping and inheritance, Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.270-278, January 21-23, 1991, Orlando, Florida, United States [doi>10.1145/99583.99620]
	23	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]
	24	Eugenio Moggi, A Category-theoretic Account of Program Modules, Category Theory and Computer Science, p.101-117, September 05-08, 1989
	25	Simon L. Peyton Jones, The Implementation of Functional Programming Languages (Prentice-Hall International Series in Computer Science), Prentice-Hall, Inc., Upper Saddle River, NJ, 1987
	26	Zhong Shao , Andrew W. Appel, Smartest recompilation, Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.439-450, March 1993, Charleston, South Carolina, United States [doi>10.1145/158511.158702]
	27	Mads Tofte, Principal signatures for higher-order program modules, Proceedings of the 19th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.189-199, January 19-22, 1992, Albuquerque, New Mexico, United States [doi>10.1145/143165.143206]
	28	Philip Wadler, The essence of functional programming, Proceedings of the 19th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.1-14, January 19-22, 1992, Albuquerque, New Mexico, United States [doi>10.1145/143165.143169]

CITED BY 15

	Johan Nordlander, Pragmatic subtyping in polymorphic languages, ACM SIGPLAN Notices, v.34 n.1, p.216-227, Jan. 1999
	Zhong Shao, Transparent modules with fully syntatic signatures, ACM SIGPLAN Notices, v.34 n.9, p.220-232, Sept. 1999
	Simon Peyton Jones , Mark Shields , John Launchbury , Andrew Tolmach, Bridging the gulf: a common intermediate language for ML and Haskell, Proceedings of the 25th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.49-61, January 19-21, 1998, San Diego, California, United States
	Tim Sheard, Generic unification via two-level types and parameterized modules, ACM SIGPLAN Notices, v.36 n.10, October 2001
	Derek Dreyer, Recursive type generativity, ACM SIGPLAN Notices, v.40 n.9, September 2005
	Martin Odersky , Matthias Zenger, Scalable component abstractions, ACM SIGPLAN Notices, v.40 n.10, October 2005
	Claudio V. Russo, First-class structures for standard ML, Nordic Journal of Computing, v.7 n.4, p.348-374, Winter 2000
	Derek Dreyer , Robert Harper , Manuel M. T. Chakravarty , Gabriele Keller, Modular type classes, ACM SIGPLAN Notices, v.42 n.1, January 2007
	Zhong Shao, Typed cross-module compilation, ACM SIGPLAN Notices, v.34 n.1, p.141-152, Jan. 1999
	DEREK DREYER, Recursive type generativity, Journal of Functional Programming, v.17 n.4-5, p.433-471, July 2007
	Davide Ancona , Elena Zucca, A theory of mixin modules: algebraic laws and reduction semantics, Mathematical Structures in Computer Science, v.12 n.6, p.701-737, December 2002
	Philippe Narbel, Type sharing constraints and undecidability, Journal of Functional Programming, v.17 n.2, p.207-214, March 2007
	Tim Sheard , Emir Pasalic, Two-level types and parameterized modules, Journal of Functional Programming, v.14 n.5, p.547-587, September 2004
	Davide Ancona , Elena Zucca, A theory of mixin modules: basic and derived operators, Mathematical Structures in Computer Science, v.8 n.4, p.401-446, August 1998
	Derek Dreyer , Andreas Rossberg, Mixin' up the ML module system, ACM SIGPLAN Notices, v.43 n.9, September 2008