An investigation of a programming language with a polymorphic type structure.
- Author:
- Nancy Jean Mccracken
Abstract
No abstract available.
Cited By
- Yu S (2001). Class-is-type is inadequate for object reuse, ACM SIGPLAN Notices, 36:6, (50-59), Online publication date: 1-Jun-2001.
- Spreen D A new model construction for the polymorphic lambda calculus Proceedings of the 7th international conference on Logic for programming and automated reasoning, (275-292)
- Güting R Second-order signature Proceedings of the 1993 ACM SIGMOD international conference on Management of data, (277-286)
- Güting R (1993). Second-order signature, ACM SIGMOD Record, 22:2, (277-286), Online publication date: 1-Jun-1993.
- O'Toole J and Gifford D Type reconstruction with first-class polymorphic values Proceedings of the ACM SIGPLAN 1989 conference on Programming language design and implementation, (207-217)
- Jouvelot P and Gifford D Reasoning about continuations with control effects Proceedings of the ACM SIGPLAN 1989 conference on Programming language design and implementation, (218-226)
- O'Toole J and Gifford D (2019). Type reconstruction with first-class polymorphic values, ACM SIGPLAN Notices, 24:7, (207-217), Online publication date: 1-Jul-1989.
- Jouvelot P and Gifford D (2019). Reasoning about continuations with control effects, ACM SIGPLAN Notices, 24:7, (218-226), Online publication date: 1-Jul-1989.
- Meseguer J Relating models of polymorphism Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, (228-241)
- Mitchell J and Harper R The essence of ML Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, (28-46)
- Meyer A, Mitchell J, Moggi E and Statman R Empty types in polymorphic lambda calculus Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, (253-262)
- Mitchell J Representation independence and data abstraction Proceedings of the 13th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, (263-276)
- MacQueen D Using dependent types to express modular structure Proceedings of the 13th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, (277-286)
- Meyer A and Reinhold M "Type" is not a type Proceedings of the 13th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, (287-295)
- Bruce K and Longo G Provable isomorphisms and domain equations in models of typed languages Proceedings of the seventeenth annual ACM symposium on Theory of computing, (263-272)
- Cartwright R Types as intervals Proceedings of the 12th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, (22-36)
- Donahue J and Demers A (1985). Data types are values, ACM Transactions on Programming Languages and Systems, 7:3, (426-445), Online publication date: 1-Jul-1985.
- MacQueen D, Plotkin G and Sethi R An ideal model for recursive polymorphic types Proceedings of the 11th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, (165-174)
- Leivant D Polymorphic type inference Proceedings of the 10th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, (88-98)
- Leivant D Structural semantics for polymorphic data types (preliminary report) Proceedings of the 10th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, (155-166)
- MacQueen D and Sethi R A semantic model of types for applicative languages Proceedings of the 1982 ACM symposium on LISP and functional programming, (243-252)
Please enable JavaScript to view thecomments powered by Disqus.
Recommendations
Polymorphic type inference and abstract data types
Many statically typed programming languages provide an abstract data type construct, such as the module in Modula-2. However, in most of these languages, implementations of abstract data types are not first-class values. Thus, they cannot be assigned to ...
Polymorphic type inference
POPL '83: Proceedings of the 10th ACM SIGACT-SIGPLAN symposium on Principles of programming languagesThe benefits of strong typing to disciplined programming, to compile-time error detection and to program verification are well known. Strong typing is especially natural for functional (applicative) languages, in which function application is the central ...