Colored local type inference

Conference Record of the Annual ACM Symposium on Principles of Programming Languages

Volumn , Issue , 2001, Pages 41-53

  Odersky, M ^a   Zenger, C ^a   Zenger, M ^a  

^a EPFL   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CONSTRAINT THEORY; INFERENCE ENGINES; PATTERN MATCHING; PROGRAM DOCUMENTATION;

GLOBAL CONSTRAINT SOLVING; PARAMETRIC POLYMORPHISM;

COMPUTER PROGRAMMING LANGUAGES;

EID: 0035042329     PISSN: 07308566     EISSN: None     Source Type: Journal    
DOI: 10.1145/373243.360207     Document Type: Article

References (32)

1. Principles and preliminary design for ML
2. Type inclusion constraints and type inference
3. Making the future safe for the past: Adding genericity to the java programming language
4. <
5. Modula-3 language definition
6. The Cecil language, specification and rationale
7. Type inference for recursively constrained types and its application to OOP
8. The reflexive chemical abstract machine and the join-calculus
9. Semi-explicit first-class polymorphism for ML
10. First-class polymorphism with type inference
11. Semantics of context-free languages
12. Constraint-based polymorphism in Cecil: Towards a practical and static type system
13. Reactive objects in a functional language - An escape from the evil I
14. Pragmatic subtyping in polymorphic languages
15. Functional nets
16. Putting type annotations to work
17. Type inference with constrained types
18. Pizza into Java: Translating theory into practice
19. Colored local type inference
20. Partial polymorphic type inference and higher-order unification
21. Simplifying subtyping constraints
22. A framework for type inference with subtyping
23. Local type inference
24. Typechecking records and variants in a natural extension of ML
25. Subtyping constraint types
26. Theorems for free!
27. Typability and type checking in the second order λ-calculus are equivalent and undecidable
28. Simple usage polymorphism
29. Dependent types in practical programming