Type inference with polymorphic recursion
Author:
Open Access
- 1 April 1993
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Programming Languages and Systems
- Vol. 15 (2) , 253-289
Abstract
No abstract availableKeywords
This publication has 35 references indexed in Scilit:
- Semi-unificationTheoretical Computer Science, 1991
- An overview of MirandaACM SIGPLAN Notices, 1986
- On understanding types, data abstraction, and polymorphismACM Computing Surveys, 1985
- Properties of substitutions and unificationsJournal of Symbolic Computation, 1985
- A polymorphic type system for prologArtificial Intelligence, 1984
- On the sequential nature of unificationThe Journal of Logic Programming, 1984
- An Efficient Unification AlgorithmACM Transactions on Programming Languages and Systems, 1982
- Confluent Reductions: Abstract Properties and Applications to Term Rewriting SystemsJournal of the ACM, 1980
- A theory of type polymorphism in programmingJournal of Computer and System Sciences, 1978
- Modified Basic Functionality in Combinatory LogicDialectica, 1969