Minimal typings in atomic subtyping

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Minimal typings in atomic subtyping

Full text

Pdf (1.26 MB)

Source

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

Paris, France

Pages: 278 - 291

Year of Publication: 1997

ISBN:0-89791-853-3

Author

Jakob Rehof

DIKU, Department of Computer Science, University of Copenhagen, Denmark

Sponsors

L'Ecole des Mines de Paris : L'Ecole des Mines de Paris
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
Ctr Natl de la Recherche Sci :
SIGPLAN: ACM Special Interest Group on Programming Languages

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 3, Downloads (12 Months): 15, Citation Count: 5

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/263699.263738 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	Martin Abadi , Luca Cardelli, A Theory of Objects, Springer-Verlag New York, Inc., Secaucus, NJ, 1996
	2	A.V. Aho, R. Garey, and J.D. Ullman. The transitive reduction of a directed graph. SlAM Journal of Computing, 1(2):131-137, June 1972.
	3	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]
	4	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]
	5	Alexander Aiken , Edward L. Wimmers , Jens Palsberg, Optimal Representations of Polymorphic Types with Subtyping, University of California at Berkeley, Berkeley, CA, 1996
	6	H.P. Barendregt. The Lambda Calculus: Its Syntaz and Semantics, volume 103 of Studies in Logic and the Foundations of Mathematics. North-Holland, 1984.
	7	H. P. Barendregt, Lambda calculi with types, Handbook of logic in computer science (vol. 2): background: computational structures, Oxford University Press, Inc., New York, NY, 1993
	8	Marcin Benke, Efficient Type Reconstruction in the Presence of Inheritance, Proceedings of the 18th International Symposium on Mathematical Foundations of Computer Science, p.272-280, August 30-September 03, 1993
	9	Marcin Benke. Some complexity bounds for subtype inequalities. Technical Report TR 95-20 (220), Warsaw University, Institute of Informatics, Warsaw University, Poland, December 1995.
	10	P. Curtis. Constrained quantification in polymorphic type analysis. Technical Report CSL-90-1, Xerox Parc, February 1990.
	11	Jonathan Eifrig , Scott Smith , Valery Trifonov, Sound polymorphic type inference for objects, Proceedings of the tenth annual conference on Object-oriented programming systems, languages, and applications, p.169-184, October 15-19, 1995, Austin, Texas, United States
	12	Alexander Aiken, Constraint-Based Program Analysis (Abstract), Proceedings of the Third International Symposium on Static Analysis, p.1, September 24-26, 1996
	13	You-Chin Fuh , Prateek Mishra, Polymorphic Subtype Inference: Closing the Theory-Practice Gap, Proceedings of the International Joint Conference on Theory and Practice of Software Development, Volume 2: Advanced Seminar on Foundations of Innovative Software Development II and Colloquium on Current Issues in Programming Languages, p.167-183, March 13-17, 1989
	14	You-Chin Fuh , Prateek Mishra, Type inference with subtypes, Theoretical Computer Science, v.73 n.2, p.155-175, June 22, 1990
	15	Carl A. Gunter , John C. Mitchell, Theoretical aspects of object-oriented programming: types, semantics, and language design, MIT Press, Cambridge, MA, 1994
	16	Fritz Henglein , Christian Mossin, Polymorphic Binding-Time Analysis, Proceedings of the 5th European Symposium on Programming: Programming Languages and Systems, p.287-301, April 11-13, 1994
	17	My Hoang , John C. Mitchell, Lower bounds on type inference with subtypes, Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.176-185, January 23-25, 1995, San Francisco, California, United States [doi>10.1145/199448.199481]
	18	Paul Hudak , Joseph H. Fasel, A gentle introduction to Haskell, ACM SIGPLAN Notices, v.27 n.5, p.1-52, May 1992 [doi>10.1145/130697.130698]
	19	Stefan Kaes, Type inference in the presence of overloading, subtyping and recursive types, Proceedings of the 1992 ACM conference on LISP and functional programming, p.193-204, June 22-24, 1992, San Francisco, California, United States
	20	P. Kanellakis, H. Mairson, and J.C. Mitchell. Unification and ML type reconstruction. In J.-L. Lassez and G. Plotkin, editors, Computational Logic -- Essays in Honor of Alan Robinson. MIT Press, 1991.
	21	Patrick Lincoln , John C. Mitchell, Algorithmic aspects of type inference with subtypes, Proceedings of the 19th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.293-304, January 19-22, 1992, Albuquerque, New Mexico, United States [doi>10.1145/143165.143227]
	22	Robin Milner , Mads Tofte , Robert Harper, The definition of Standard ML, MIT Press, Cambridge, MA, 1990
	23	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]
	24	J.C. Mitchell. Type inference with simple subtypes. Journal of Functional Programming, 1(3):245-285, July 1991.
	25	John C. Mitchell, Foundations of programming languages, MIT Press, Cambridge, MA, 1996
	26	François Pottier, Simplifying subtyping constraints, Proceedings of the first ACM SIGPLAN international conference on Functional programming, p.122-133, May 24-26, 1996, Philadelphia, Pennsylvania, United States
	27	V. Pratt and J. Tiuryn. Satisfiability of inequalities in a poset. Studia Logiea (to appear).
	28	D. Prawitz. Natural deduction. Almquist & Wiksell, Uppsala 1965.
	29	J. Rehof. Minimal typings in atomic subtyping. Technical Report D-278, DIKU, Dept. of Computer Science, University of Copenhagen, Denmark. Available at http://www.diku.dk/researchgroups/topps/personal/rehof/publications.html, 1996.
	30	Geoffrey S. Smith, Principal type schemes for functional programs with overloading and subtyping, Science of Computer Programming, v.23 n.2-3, p.197-226, Dec. 1994
	31	J. Tiuryn. Subtype inequalities. In Proc. 7th Annual IEEE Syrup. on Logic in Computer Science (LICS), Santa Cruz, California, pages 308-315. IEEE Computer Society Press, June 1992.
	32	Valery Trifonov , Scott F. Smith, Subtyping Constrained Types, Proceedings of the Third International Symposium on Static Analysis, p.349-365, September 24-26, 1996
	33	D. A. Turner, Miranda: a non-strict functional language with polymorphic types, Proc. of a conference on Functional programming languages and computer architecture, p.1-16, January 1985, Nancy, France
	34	M. Wand. A simple algorithm and proof for type inference. Fundamenta lnformaticae, X:115-122, 1987.

CITED BY 5

	Johan Nordlander, Pragmatic subtyping in polymorphic languages, ACM SIGPLAN Notices, v.34 n.1, p.216-227, Jan. 1999
	François Pottier , Vincent Simonet, Information flow inference for ML, ACM SIGPLAN Notices, v.37 n.1, p.319-330, Jan. 2002
	Joachim Niehren , Tim Priesnitz, Non-structural subtype entailment in automata theory, Information and Computation, v.186 n.2, p.319-354, 01 November 2003
	François Pottier , Vincent Simonet, Information flow inference for ML, ACM Transactions on Programming Languages and Systems (TOPLAS), v.25 n.1, p.117-158, January 2003
	Jakob Rehof , Manuel Fähndrich, Type-base flow analysis: from polymorphic subtyping to CFL-reachability, ACM SIGPLAN Notices, v.36 n.3, p.54-66, March 2001