Understanding Russell–a first attempt
Proc. of the international symposium on Semantics of data types
ACM Transactions on Programming Languages and Systems (TOPLAS)
Higher-order logic programming
Proceedings on Third international conference on logic programming
SIGPLAN '86 Proceedings of the 1986 SIGPLAN symposium on Compiler construction
The type inference and coercion facilities in the scratchpad II interpreter
SIGPLAN '87 Papers of the Symposium on Interpreters and interpretive techniques
Polymorphic type inference and containment
Information and Computation - Semantics of Data Types
Pebble, a kernel language for modules and abstract data types
Information and Computation - Semantics of Data Types
Partial polymorphic type inference and higher-order unification
LFP '88 Proceedings of the 1988 ACM conference on LISP and functional programming
POPL '88 Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
POPL '88 Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A proper extension of ML with an effective type-assignment
POPL '88 Proceedings of the 15th 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 '86 Proceedings of the 13th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
POPL '83 Proceedings of the 10th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Principal type-schemes for functional programs
POPL '82 Proceedings of the 9th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A Primer: 11 Keys to New Scratchpad
EUROSAM '84 Proceedings of the International Symposium on Symbolic and Algebraic Computation
Towards a theory of type structure
Programming Symposium, Proceedings Colloque sur la Programmation
LFP '84 Proceedings of the 1984 ACM Symposium on LISP and functional programming
An Informal Description of Russell
An Informal Description of Russell
Rationale for the design of the Ada programming language
ACM SIGPLAN Notices - Rationale for the deisgn of the Ada programming language
ACM SIGPLAN Notices
Type-dependent parameter inference
PLDI '90 Proceedings of the ACM SIGPLAN 1990 conference on Programming language design and implementation
Type inference with polymorphic recursion
ACM Transactions on Programming Languages and Systems (TOPLAS)
Putting type annotations to work
POPL '96 Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
POPL '98 Proceedings of the 25th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
ACM Transactions on Programming Languages and Systems (TOPLAS)
| Hi-index | 0.01 |
A number of recent programming language designs incorporate a type checking system based on the Girard-Reynolds polymorphic &lgr;-calculus. This allows the construction of general purpose, reusable software without sacrificing compile-time type checking. A major factor constraining the implementation of these languages is the difficulty of automatically inferring the lengthy type information that is otherwise required if full use is made of these languages. There is no known algorithm to solve any natural and fully general formulation of this “type inference” problem. One very reasonable formulation of the problem is known to be undecidable.Here we define a restricted version of the type inference problem and present an efficient algorithm for its solution. We argue that the restriction is sufficiently weak to be unobtrusive in practice.