Refinement Types for ML

ACM SIGPLAN Notices

Volumn 26, Issue 6, 1991, Pages 268-277

  Freeman, Tim ^a   Pfenning, Frank ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84976808261     PISSN: 03621340     EISSN: 15581160     Source Type: Journal    
DOI: 10.1145/113446.113468     Document Type: Article

References (19)

1. Roberto M. Amadio and Luca Cardelli. Subtyping recursive types. Research Report 62, Digital Systems Research Center, Palo Alto, California, August 1990.
2. J. R. Burch, E. M. Clarke, K. L. McMillan, D. L. Dill, and L. J. Hwang. Symbolic model checking: 1020 states and beyond. In Proceedings of the Fifth Annual IEEE Symposium on Logic in Computer Science, pages 428-439, Philadelphia, PA, June 1990. IEEE Computer Society Press.
3. Randal E. Bryant. Graph-based algorithms for boolean function manipulation. IEEE Transactions on Computers, C-35(8):677-691, August 1986.
4. Luca Cardelli. Typeful programming. Research Report 45, Digital Equipment Corporation, Systems Research Center, Palo Alto, California, February 1989.
5. Peter Canning, William Cook, Walter Hill, and Walter Olthoff. F-bounded polymorphism for object-oriented programming. In Functional Programming Languages and Computer Architecture. ACM, 1989.
6. Dominique Clément, Joëlle Despeyroux, Thierry Despeyroux, and Gilles Kahn. A simple applicative language: Mini-ML. In Proceedings of the 1986 Conference on LISP and Functional Programming. ACM Press, 1986.
7. Luca Cardelli and Peter Wegner. On understanding types, data abstraction, and polymorphism. ACM Computing Surveys, 17:471-522, 1985.
8. Ferenc Gécseg and Magnus Steinby. Tree Automata. Akadémiai Kiadó, Budapest, 1984.
9. Nevin Heintze and Joxan Jaffar. A decision procedure for a class of set constraints. In Proceedings of the Fifth Annual IEEE Symposium on Logic in Computer Science, Philadelphia. IEEE, June 1990.
10. A. J. Kfoury, J. Tiuryn, and P. Urzyczyn. Type-checking in the presence of polymorphic recursion. To appear in TOPLAS, October 1989.
11. Prateek Mishra. Towards a theory of types in Prolog. In International Symposium on Logic Programming, pages 289-298. IEEE, 1984.
12. Robin Milner, Mads Tofte, and Robert Harper. The Definition of Standard ML. MIT Press, Cambridge, Massachusetts, 1990.
13. Alan Mycroft. Polymorphic Type Schemes and Recursive Definitions, pages 217-228. International Symposium on Programming. Springer-Verlag, New York, 1984. LNCS 167.
14. Benjamin Pierce. A decision procedure for the subtype relation on intersection types with bounded variables. Technical Report
15. CMU-CS-89-169, School of Computer Science, Carnegie Mellon University, Pittsburgh, Pennsylvania, September 1989.
16. Benjamin C. Pierce. Preliminary investigation of a calculus with intersection and union types. Unpublished manuscript, June 1990.
17. Simone Ronchi Della Rocca. Principal type scheme and unification for intersection type discipline. Theoretical Computer Science, 59:181-209, 1988.
18. John C. Reynolds. Preliminary design of the programming language Forsythe. Technical Report CMU-CS-88-159, Carnegie Mellon University, Pittsburgh, Pennsylvania, June 1988.
19. Eyal Yardeni, Thom Fruehwirth, and Ehud Shapiro. Polymorphically typed logic programs. In Frank Pfenning, editor, Types in Logic Programming. MIT Press, Cambridge, Massachusetts, 1991. To appear.