ACM Transactions on Programming Languages and Systems (TOPLAS)
Safe polymorphic type inference for a dynamically typed language: translating Scheme to ML
FPCA '95 Proceedings of the seventh international conference on Functional programming languages and computer architecture
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
An Automatic Program Generator for Multi-Level Specialization
Lisp and Symbolic Computation
Recursive subtyping revealed: (functional pearl)
ICFP '00 Proceedings of the fifth ACM SIGPLAN international conference on Functional programming
A coinductive completeness proof for the equivalence of recursive types
Theoretical Computer Science
Type inference for variant object types
Information and Computation - FOOL VII
Fixed-Point Logic with the Approximation Modality and Its Kripke Completeness
TACS '01 Proceedings of the 4th International Symposium on Theoretical Aspects of Computer Software
Incremental Inference of Partial Types
ICTCS '01 Proceedings of the 7th Italian Conference on Theoretical Computer Science
Type Inference with Recursive Type Equations
FoSSaCS '01 Proceedings of the 4th International Conference on Foundations of Software Science and Computation Structures
LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
Journal of Functional Programming
Type and behaviour reconstruction for higher-order concurrent programs
Journal of Functional Programming
Theoretical Computer Science - Clifford lectures and the mathematical foundations of programming semantics
Calculi, types and applications
Theoretical Computer Science
Flow-sensitive type systems and the ambient calculus
Higher-Order and Symbolic Computation
Coinductive Axiomatization of Recursive Type Equality and Subtyping
Fundamenta Informaticae
Positive Recursive Type Assignment
Fundamenta Informaticae
| Hi-index | 0.00 |