ML Has Principal Typings (original) (raw)
Related papers
Introduction to generalized type systems
Electronic Notes in Theoretical Computer Science, 1998
A Type-Theoretic Approach to Higher-Order
POPL}
Ferruccio Guidi, Andrea Asperti
2012
Principal typings for Java-like languages
ACM SIGPLAN Notices, 2004
2000
Type-Checking and Normalisation By Evaluation for Dependent Type Systems
Certification of a Type Inference Tool for ML: Damas–Milner within Coq
Journal of Automated Reasoning - JAR, 1999
Type inference with polymorphic recursion
ACM Transactions on Programming Languages and Systems, 1993
Type Systems for Computer Algebra
1993
Axiomathes, 2014
A Rewriting Logic Approach to Type Inference: Technical Report
Type inference with constrained types
Theory and Practice of Object Systems, 1999
A unified view of modalities in type systems
Proceedings of the ACM on Programming Languages
Notes on Type Abstraction (Version 2)
IEEE Transactions on Software Engineering, 2000
The type system of a higher-order logic programming language
1992
A type system with usage aspects
Journal of Functional Programming, 2008
Polymorphic typing of an algorithmic language
Encoding types in ML-like languages
Theoretical Computer Science, 2004
A Type Theory with Re ection by
2012
Theoretical Computer Science, 1997
1994
Monadic Type Systems: Pure Type Systems for Impure Settings (Preliminary Report)
Electronic Notes in Theoretical Computer Science, 1998
Extending the type checker of Standard ML by polymorphic recursion
Theoretical Computer Science, 1999
A Rewriting Logic Approach to Type Inference
Lecture Notes in Computer Science, 2009
Programming in Martin-Löf's Type Theory: An Introduction
1990
Even more principal typings for Java-like languages
2004
Theoretical Computer Science, 1990
Concoqtion: Mixing Indexed Types and Hindley-Milner Type Inference
2006
The typed polymorphic label-selective λ-calculus
Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '94, 1994
2012
2015
Type assigment systems for lambda calculi and for the lambda calculus of objects
ThŁse de Doctorat, UniversitØ de Turin, 1996
Typing first-class continuations in ML
Journal of Functional Programming, 1993
On Polymorphic Recursion, Type Systems, and Abstract Interpretation
Lecture Notes in Computer Science, 2008