Subtyping with union types, intersection types and recursive types

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 789 LNCS, Issue , 1994, Pages 687-706

  Damm, Flemming M ^a  

^a TECHNICAL UNIVERSITY OF DENMARK   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SOFTWARE; DECISION THEORY; FORESTRY; PROBLEM ORIENTED LANGUAGES; SET THEORY; TOPOLOGY;

DECISION PROBLEMS; INTERSECTION TYPES; METRIC SPACES; RECURSIVE TYPES; REGULAR TREE; SIMULTANEOUS USE; SOUNDNESS AND COMPLETENESS; TYPECHECKING;

FORMAL LANGUAGES;

EID: 17644401312     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-57887-0_121     Document Type: Conference Paper

References (16)

1. Roberto M. Amadio and Luca Cardelli. Subtyping recursive types. In Conference Record of the Eighteenth Annual ACM Symposium on Principles of Programming Languages (POPL'91), pages 104-118, ACM Press, 1991. Extended abstract. Full version in [AC92].
2. Roberto M. Amadio and Luca Cardelli. Subtyping Recursive Types. Technical Report 133, INRIA, Institut National de Recherche en Informatique et en Automatique, Lorraine, February 1992.
3. Alexander Aiken and Brian M. Murphy. Implementing regular tree expressions. In J. Hughes, editor, Proceedings of the 5th A CM Conference on Functional Programming Languages and Computer Architecture (FPCA '91), Cambridge, MA, USA, August 1991, volume 523 of Lecture Notes in Computer Science, pages 427-447, Springer-Verlag, 1991.
4. Alexander Aiken and Brian M. Murphy. Static type inference in a dynamically typed language. In Conference Record of the Eighteenth Annual A CM Symposium on Principles of Programming Languages (POPL '91), pages 279-290, ACM Press, 1991.
5. Alexander Aiken and Edward L. Wimmers. Solving systems of set constraints (extended abstract). In Proceedings of the Seventh Annual IEEE Symposium on Logic in Computer Science (LICS'92), Santa Cruz, California, June 1992, pages 329-340, IEEE Computer Society, IEEE Computer Society Press, 1992.
6. Alexander Aiken and Edward L. Wimmers. Type inclusion constraints and type inference. In Proceedings of the 6th A CM Conference on Functional Programming Languages and Computer Architecture (FPCA '93), Copenhagen, Denmark~ June 1993, pages 31-41, ACM Press, 1993.
7. Robert Cartwright and Mike Fagan. Soft typing. In Proceedings of the A CM SIGPLAN'91 Conference on Programming Language Design and Implementation (PLDI'91), pages 278-292, ACM Press, 1991.
8. Luca Cardelli and Peter Wegner. On understanding types, data abstraction, and polymorphism. Computing Surveys, 17(4):471-522, 1985.
9. Flemming M. Damm. Subtyping with Union Types, Intersection Types and Recursive Types. Technical Report, Department of Computer Science, The Technical University of Denmark, 1994. Forthcoming.
10. Tim Freeman and Frank Pfenning. Refinement types for ML. In Proceedings of the ACM SIGPLAN'91 Conference on Programming Language Design and Implementation (PLDI'91), pages 268-277, ACM Press, 1991.
11. Ferenc Gécseg and Magnus Steinby. Tree Automata. Akadfimiai Kiadó, Budapest, 1984.
12. R. Gilleron, S. Tison, and M. Tommasi. Solving systems of set constraints with negated subset relationships. In Proceedings of the 34th Annuel Symposium on Foundations of Computer Science (FOCS'93), pages 372-380, IEEE Computer Society, IEEE Computer Society Press, 1993.
13. David MacQueen, Gordon Plotkin, and Ravi Sethi. An ideal model for recursive polymorphic types. Information and Control, 71:95-130, 1986.
14. Prateek Mishra and Uday S. Reddy. Declaration-free type checking. In Conference Record of the Twelfth Annual ACM Symposium on Principles of Programming Languages (POPL'85), pages 7-21, 1985.
15. Benjamin C. Pierce. Programming with Intersection Types, Union Types and Polymorphism. Technical Report CMU-CS-91-106, Carnegie Mellon University, 1991.
16. W.A. Sutherland. Introduction to metric and topological spaces. Oxford University Press, 1975.