Abstract types have existential type
ACM Transactions on Programming Languages and Systems (TOPLAS)
POPL '88 Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Type inference in the presence of type abstraction
PLDI '89 Proceedings of the ACM SIGPLAN 1989 Conference on Programming language design and implementation
Type checking records and variants in a natural extension of ML
POPL '89 Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Polymorphic unification and ML typing
POPL '89 Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
POPL '89 Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
LFP '90 Proceedings of the 1990 ACM conference on LISP and functional programming
Type-dependent parameter inference
PLDI '90 Proceedings of the ACM SIGPLAN 1990 conference on Programming language design and implementation
Bounded quantification is undecidable
POPL '92 Proceedings of the 19th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Explicit polymorphism and CPS conversion
POPL '93 Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Type reconstruction in the presence of polymorphic recursion
ACM Transactions on Programming Languages and Systems (TOPLAS)
Type inference with polymorphic recursion
ACM Transactions on Programming Languages and Systems (TOPLAS)
Intersection types and computational effects
ICFP '00 Proceedings of the fifth ACM SIGPLAN international conference on Functional programming
Intuitionistic Light Affine Logic
ACM Transactions on Computational Logic (TOCL)
Completeness of intersection and union type assignment systems for call-by-value λ-models
Theoretical Computer Science - Special issue on theories of types and proofs
Completeness of type assignment systems with intersection, union, and type quantifiers
Theoretical Computer Science - Special issue on theories of types and proofs
A complete characterization of complete intersection-type preorders
ACM Transactions on Computational Logic (TOCL)
Coercive subtyping for the calculus of constructions
POPL '03 Proceedings of the 30th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Products and polymorphic subtypes
Fundamenta Informaticae
Retraction Approach to CPS Transform
Higher-Order and Symbolic Computation
Type Reconstruction for Functional Programs with Subtyping over a Lattice of Atomic Types
MFCS '99 Proceedings of the 24th International Symposium on Mathematical Foundations of Computer Science
Explicitly Typed lambda µ-Calculus for Polymorphism an Call-by-Value
TLCA '99 Proceedings of the 4th International Conference on Typed Lambda Calculi and Applications
The subtyping problem for second-order types is undecidable
Information and Computation
The Subtyping Problem for Second-Order Types is Undecidable
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
MLF: raising ML to the power of system F
ICFP '03 Proceedings of the eighth ACM SIGPLAN international conference on Functional programming
Mathematical Structures in Computer Science
Constraint-set satisfiability for overloading
PPDP '04 Proceedings of the 6th ACM SIGPLAN international conference on Principles and practice of declarative programming
Essential language support for generic programming
Proceedings of the 2005 ACM SIGPLAN conference on Programming language design and implementation
Simple, partial type-inference for System F based on type-containment
Proceedings of the tenth ACM SIGPLAN international conference on Functional programming
A short survey of isomorphisms of types
Mathematical Structures in Computer Science
Quantified types in an imperative language
ACM Transactions on Programming Languages and Systems (TOPLAS)
Theoretical Computer Science - Clifford lectures and the mathematical foundations of programming semantics
Practical type inference for arbitrary-rank types
Journal of Functional Programming
On the building of affine retractions
Mathematical Structures in Computer Science
FPH: first-class polymorphism for Haskell
Proceedings of the 13th ACM SIGPLAN international conference on Functional programming
A System F with Call-by-Name Exceptions
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
Information and Computation
Semantic predicate types and approximation for class-based object oriented programming
Proceedings of the 11th International Workshop on Formal Techniques for Java-like Programs
A Polymorphic Type System for the Lambda-Calculus with Constructors
TLCA '09 Proceedings of the 9th International Conference on Typed Lambda Calculi and Applications
Intersection, universally quantified, and reference types
CSL'09/EACSL'09 Proceedings of the 23rd CSL international conference and 18th EACSL Annual conference on Computer science logic
A typed store-passing translation for general references
Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A language for generic programming in the large
Science of Computer Programming
On polymorphic types of untyped terms
WoLLIC'11 Proceedings of the 18th international conference on Logic, language, information and computation
Typed self-interpretation by pattern matching
Proceedings of the 16th ACM SIGPLAN international conference on Functional programming
On the power of coercion abstraction
POPL '12 Proceedings of the 39th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A church-style intermediate language for MLF
FLOPS'10 Proceedings of the 10th international conference on Functional and Logic Programming
A church-style intermediate language for MLF
Theoretical Computer Science
Expansion for universal quantifiers
ESOP'12 Proceedings of the 21st European conference on Programming Languages and Systems
Complete and easy bidirectional typechecking for higher-rank polymorphism
Proceedings of the 18th ACM SIGPLAN international conference on Functional programming
| Hi-index | 0.00 |