Scripting the type inference process

ACM SIGPLAN Notices

Volumn 38, Issue 9, 2003, Pages 3-13

  Heeren, Bastiaan ^a   Hage, Jurriaan ^a   Swierstra, S Doaitse ^a  

^a UTRECHT UNIVERSITY   (Netherlands)

Author keywords

Constraints; Directives; Domain specific programming; Type errors; Type inference

Indexed keywords

ALGORITHMS; COMPUTER PROGRAMMING; CONSTRAINT THEORY; ERRORS; PROGRAM COMPILERS;

COMBINATOR LANGUAGES; ERROR MESSAGES; FUNCTIONAL PROGRAMMING LANGUAGES; TYPE INFERENCE PROCESSES;

COMPUTER PROGRAMMING LANGUAGES;

EID: 1442313323     PISSN: 03621340     EISSN: None     Source Type: Journal    
DOI: 10.1145/944746.944707     Document Type: Conference Paper

References (15)

1. A. Aiken and E. Wimmers. Type inclusion constraints and type inference. In Proceedings of Functional Programming Languages and Computer Architecture, pages 31-41, 1993.
2. M. Beaven and R. Stansifer. Explaining type errors in polymorphic languages. In ACM Letters on Programming Languages, volume 2, pages 17-30, December 1993.
3. O. Chitil. Compositional explanation of types and algorithmic debugging of type errors. In Proceedings of the Sixth ACM SIGPLAN International Conference on Functional Programming, pages 193-204, September 2001.
4. L. Damas and R. Milner. Principal type schemes for functional programs. In Principles of Programming Languages, pages 207-212, 1982.
5. D. Duggan and F. Bent. Explaining type inference. In Science of Computer Programming 27, pages 37-83, 1996.
6. C. Haack and J. B. Wells. Type error slicing in implicitly typed higher-order languages. In Proceedings of the 12th European Symposium on Programming, pages 284-301, April 2003.
7. B. Heeren, J. Hage, and S. D. Swierstra. Generalizing Hindley-Milner type inference algorithms. Technical Report UU-CS-2002-031, Institute of Information and Computing Science, University Utrecht, Netherlands, July 2002.
8. A. van IJzendoorn, D. Leijen, and B. Heeren. The Helium compiler. http://www.cs.uu.nl/helium.
9. J. Yang. Explaining type errors by finding the sources of type conflicts. In G. Michaelson, P. Trindler, and H.-W. Loidl, editors, Trends in Functional Programming, pages 58-66. Intellect Books, 2000.
10. O. Lee and K. Yi. Proofs about a folklore let-polymorphic type inference algorithm. ACM Transactions on Programming Languages and Systems, 20(4):707-723, July 1998.
11. O. Lee and K. Yi. A generalized let-polymorphic type inference algorithm. Technical Memorandum ROPAS-2002-5, Research on Program Analysis System, Korea Advanced Institute of Science and Technology, March 2000.
12. B. J. McAdam. How to repair type errors automatically. In 3rd Scottish Workshop on Functional Programming, pages 121-135. Stirling, U.K., August 2001.
13. M. Sulzmann, M. Odersky, and M. Wehr. Type inference with constrained types. Research Report YALEU/DCS/RR-1129, Yale University, Department of Computer Science, April 1997.
14. S. D. Swierstra. Combinator parsers: From toys to tools. In G. Hutton, editor, Electronic Notes in Theoretical Computer Science, volume 41. Elsevier Science Publishers, 2001.
15. J. A. Walz and G. F. Johnson. A maximum flow approach to anomaly isolation in unification-based incremental type inference. In Conference Record of the 13th Annual ACM Symposium on Principles of Programming Languages, pages 44-57, St. Petersburg, FL, January 1986.