Soft typing

ACM SIGPLAN Notices

Volumn 26, Issue 6, 1991, Pages 278-292

  Cartwright, Robert ^a   Fagan, Mike ^a  

^a RICE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84976788667     PISSN: 03621340     EISSN: 15581160     Source Type: Journal    
DOI: 10.1145/113446.113469     Document Type: Article

References (25)

1. Martin Abadi, Luca Cardelli, Benjamin Pierce, and Gordon Plotkin. Dynamic typing in a statically typed language. In Proceedings of the Sixteenth POPL Symposium, 1989.
2. Alexander Aiken and Brian Murphy. Static type inference in a dynamically typed language. In Proceedings of the 18th Annual Symposium on Principles of Programming Languages, 1991. To appear.
3. Andrew W. Appel and David MacQueen. Standard ML of New Jersey Reference Manual. (in preparation), 1990.
4. Robert Cartwright. A constructive alternative to axiomatic data type definitions. In Proceedings of 1980 LISP Conference, 1980.
5. William Clinger and Jonathan Rees. Revised3.99 Report on the Algorithmic Language Scheme, August 1990.
6. Alain Colmerauer. Prolog and infinite trees. In K. L. Clark and S. A. Tarnlund, editors, Logic Programming, pages 231-251. Academic Press, 1982.
7. Pavel Curtis. Constrained quantification in polymorphic type analysis. Technical Report CSL-90-1, Xerox PARC, 1990.
8. Luis Damas and Robin Milner. Principal type-schemes for functional programs. In Conference Record of the Ninth Annual ACM Symposium on Principles of Programming Languages, 1982.
9. Luis Manuel Martins Damas. Type Assignment in Programming Languages. PhD thesis, University of Edinburgh, 1985.
10. Bruce F. Duba, Robert Harper, and David MacQueen. Typing first-class continuations in ML. In Conference Record of the Eighteenth Annual ACM Symposium on Principles of Programming Languages, 1991.
11. Mike Fagan. Soft Typing: An Approach to Type Checking for Dynamically Typed Languages. PhD thesis, Rice University, 1990.
12. You-Chin Fuh and Prateek Mishra. Type inference with subtypes. In Conference Record of the European Symposium on Programming, 1988.
13. You-Chin Fuh and Prateek Mishra. Polymorphic subtype inference: Closing the theory-practice gap. In TAPSOFT, 1989.
14. Carsten K. Gomard. Partial type inference for untyped functional programs. In Proceedings of the 1990 ACM Conference on LISP and Functional Programming, 1990.
15. Gérard Huet. Resolution d'équations dans les langages d'ordre 1, 2,., ?. PhD thesis, Université Paris, 7 1976.
16. D. MacQueen, G. Plotkin, and R. Sethi. An ideal model for recursive polymorphic types. In Conference Record of the Eleventh Annual ACM Symposium on Principles of Programming Languages, 1983.
17. D. B. MacQueen and Ravi Sethi. A semantic model of types for applicative languages. In Conference Record of the Tenth Annual ACM Symposium on Principles of Programming Languages, 1982.
18. Robin Milner. A theory of type polymorphism in programming. Journal of Computer and System Sciences, 1978.
19. Robin Milner, Mads Tofte, and Robert Harper. The Definition of Standard ML. MIT Press, 1990.
20. John C. Mitchell. Coercion and type inference. In Conference Record of the Eleventh Annual ACM Symposium on Principles of Programming Languages, 1983.
21. Dider Rémy. Typechecking records and variants in a natural extension of ml. In Conference Record of the Sixteenth Annual ACM Symposium on Principles of Programming Languages, 1989.
22. David A Schmidt. Denotational Semantics. Allyn and Bacon, Inc, 1986.
23. Sattish Thatte. Quasi-static typing. In Proceedings of the Seventeenth POPL Symposium, 1990.
24. Mads Tofte. Operational Semantics and Polymorphic Type Inference. PhD thesis, University of Edinburgh, 1987.
25. Mitchell Wand. Complete type inference for simple objects. In Proceedings of the Second Symposium on Logic in Computer Science, 1987.