Abstract types have existential type
ACM Transactions on Programming Languages and Systems (TOPLAS)
Partial polymorphic type inference and higher-order unification
LFP '88 Proceedings of the 1988 ACM conference on LISP and functional programming
Type reconstruction with first-class polymorphic values
PLDI '89 Proceedings of the ACM SIGPLAN 1989 Conference on Programming language design and implementation
Meta-circular interpreter for a strongly typed language
Journal of Symbolic Computation
PLDI '94 Proceedings of the ACM SIGPLAN 1994 conference on Programming language design and implementation
A direct algorithm for type inference in the rank-2 fragment of the second-order &lgr;-calculus
LFP '94 Proceedings of the 1994 ACM conference on LISP and functional programming
What are principal typings and what are they good for?
POPL '96 Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Putting type annotations to work
POPL '96 Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Abstract types have existential types
POPL '85 Proceedings of the 12th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
A simple applicative language: mini-ML
LFP '86 Proceedings of the 1986 ACM conference on LISP and functional programming
A type-inference approach to reduction properties and semantics of polymorphic expressions (summary)
LFP '86 Proceedings of the 1986 ACM conference on LISP and functional programming
A new approach to generic functional programming
Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Perfect trees and bit-reversal permutations
Journal of Functional Programming
Generalizing generalized tries
Journal of Functional Programming
de Bruijn notation as a nested datatype
Journal of Functional Programming
Parametric polymorphism for software component architectures
OOPSLA '05 Proceedings of the 20th annual ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications
Explicit substitutions and higher-order syntax
Higher-Order and Symbolic Computation
| Hi-index | 0.00 |