On understanding types, data abstraction, and polymorphism
ACM Computing Surveys (CSUR) - The MIT Press scientific computation series
CLEAN: A language for functional graph rewriting
Proc. of a conference on Functional programming languages and computer architecture
Programming in Martin-Lo¨f's type theory: an introduction
Programming in Martin-Lo¨f's type theory: an introduction
Inheritance as implicit coercion
Information and Computation
Computation and reasoning: a type theory for computer science
Computation and reasoning: a type theory for computer science
Typing algorithm in type theory with inheritance
Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Type inference with constrained types
Theory and Practice of Object Systems - Special issue on foundations of object-oriented languages
A Machine-Oriented Logic Based on the Resolution Principle
Journal of the ACM (JACM)
The Definition of Standard ML
Principal type-schemes for functional programs
POPL '82 Proceedings of the 9th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
An Implementation of LF with Coercive Subtyping & Universes
Journal of Automated Reasoning
Fundamental Concepts in Programming Languages
Higher-Order and Symbolic Computation
Monads for Functional Programming
Advanced Functional Programming, First International Spring School on Advanced Functional Programming Techniques-Tutorial Text
Coercive Subtyping in Type Theory
CSL '96 Selected Papers from the10th International Workshop on Computer Science Logic
POPL '84 Proceedings of the 11th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Transitivity in coercive subtyping
Information and Computation
Weak transitivity in coercive subtyping
TYPES'02 Proceedings of the 2002 international conference on Types for proofs and programs
Manifest Fields and Module Mechanisms in Intensional Type Theory
Types for Proofs and Programs
A theory of typed coercions and its applications
Proceedings of the 14th ACM SIGPLAN international conference on Functional programming
Lightweight monadic programming in ML
Proceedings of the 16th ACM SIGPLAN international conference on Functional programming
Extending hindley-milner type inference with coercive structural subtyping
APLAS'11 Proceedings of the 9th Asian conference on Programming Languages and Systems
Equality proofs and deferred type errors: a compiler pearl
Proceedings of the 17th ACM SIGPLAN international conference on Functional programming
Complete completion using types and weights
Proceedings of the 34th ACM SIGPLAN conference on Programming language design and implementation
| Hi-index | 0.00 |
We incorporate the idea of coercive subtyping, a theory of abbreviation for dependent type theories, into the polymorphic type system in functional programming languages. The traditional type system with let-polymorphism is extended with argument coercions and function coercions, and a corresponding type inference algorithm is presented and proved to be sound and complete.