A syntactic approach to type soundness

Information and Computation

Volumn 115, Issue 1, 1994, Pages 38-94

  Wright, Andrew K ^a   Felleisen, Matthias ^a  

^a RICE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0003025818     PISSN: 08905401     EISSN: 10902651     Source Type: Journal    
DOI: 10.1006/inco.1994.1093     Document Type: Article

References (43)

1. Abadi, M., Cardelli, L., Pierce, B., and Plotkin, G. (1991), Dynamic typing in a statically-typed language, in "ACM Transactions on Programming Languages and Systems 13," Vol. 2, pp. 237-268
2. Abadi, M., Cardelli, L., Pierce, B., and Plotkin, G. Previously appeared in "Proceedings of the 16 th Annual Symposium on Principles of Programming Languages," pp. 213-227 (1989).
3. Barendregt, H. P. (1984), "The Lambda Calculus: Its Syntax and Semantics," revised ed., Studies in Logic and the Foundations of Mathematics, Vol. 103, North-Holland, Amsterdam.
4. Crank, E., and Felleisen, M. (1991), Parameter-passing and the lambda calculus, in "Proceedings of the 18 th Annual Symposium on Principles of Programming Languages," pp. 233-244.
5. Curry, H. B., and Feys, R. (1958), "Combinatory Logic," Vol.1, North-Holland, Amsterdam.
6. Damas, L., and Milner, R. (1982), Principal type schemes for functional programs, in "Proceedings of the 9th Annual Symposium on Principles of Programming Languages," pp. 207-212.
7. Damas, L. M. M. (1985), "Type Assignment in Programming Languages," Ph.D. thesis, University of Edinburgh.
8. Donahue, J., and Demers, A. (1985), Data types are values, ACM Trans. Programming Languages Systems 7, No. 3, 426-445.
9. Duba, B. F., Harper, R., and MacQueen, D. (1991), Typing first-class continuations in ML, in "Proceedings of the 18 th Annual Symposium on Principles of Programming Languages," pp. 163-173.
10. Felleisen, M. (1988), The theory and practice of first-class prompts, in "Proceedings of the 15 th Annual Symposium on Principles of Programming Languages," pp. 180-190.
11. Felleisen, M. (1991), On the expressive power of programming languages, Sci. Comput. Programming 17, 35-75
12. Felleisen, M. preliminary version in "Proceedings of the European Symposium on Programming," Lecture Notes on Computer Science, Vol. 432, Springer-Verlag, Berlin/New York (1990).
13. Felleisen, M., and Friedman, D. P. (1986), Control operators, the SECD-machine, and the ʎ-calculus, in "Formal Description of Programming Concepts III" (M. Wirsing, Ed.), pp. 193-217, Elsevier (North-Holland), Amsterdam.
14. Felleisen, M., and Friedman, D. P. (1989), A syntactic theory of sequential state, Theoret. Comput. Sci. 69, No. 3, 243-287
15. Felleisen, M., and Friedman, D. P. preliminary version in "Proceedings of the 14th Annual Symposium on Principles of Programming Languages," pp. 314-325 (1987).
16. Felleisen, M., Friedman, D.P., Kohlbecker, E. E., and Duba, B. (1987), A syntactic theory of sequential control, Theoret. Comput. Sci. 52, No. 3, 205-237
17. Felleisen, M., Friedman, D.P., Kohlbecker, E. E., and Duba, B. preliminary version in "Proceedings of the Symposium on Logic in Computer Science," pp. 131-141 (1986).
18. Felleisen, M., and Hieb, R. (1992), The Revised Report on the Syntactic Theories of Sequential Control and State, Theoret. Comput. Sci. 102, 235-271.
19. Hindley, R. (1969), The principal type-scheme of an object in combinatory logic, Trans. Amer. Math. Soc. 146, 29-60.
20. Hindley, R. J., and Seldin, J. P. (1986), "Introduction to Combinators and ʎ-Calculus." Cambridge Univ. Press, London/New York.
21. Leroy, X., and Weis, P. (1991), Polymorphic type inference and assignment, in "Proceedings of the 18th Annual Symposium on Principles of Programming Languages," pp. 291-302.
22. MacQueen, D. B., Plotkin, G., and Sethi, R. (1984), An ideal model for recursive polymorphic types, in "Proceedings of the 11 th Annual Symposium on Principles of Programming Languages," pp. 165-174.
23. Mason, I., and Talcott, C. (1989), Programming, transforming, and proving with function abstractions and memories, in "Proceedings of the International Conference on Automata, Languages, and Programming," pp. 574-588, Lecture Notes in Computer Science, Vol. 372, Springer-Verlag, Berlin/New York.
24. Milner, R. (1978), A theory of type polymorphism in programming, J. Comput. System Sci. 17, 348-375.
25. Milner, R., and Tofte, M. (1991), Co-induction in relational semantics, Theoret. Comput. Sci. 87, 209-220.
26. Milner, R., and Tofte, M. (1991), "Commentary on Standard ML," MIT Press, Cambridge, MA.
27. Milner, R., Tofte, M., and Harper, R. (1990), "The Definition of Standard ML," MIT Press, Cambridge, MA.
28. Mitchell, J. C., and Harper, R. (1988), The essence of ML, in "Proceedings of the 15th Annual Symposium on Principles of Programming Languages," pp. 28-46.
29. Mitchell, J. C., and Plotkin, G. D. (1988), Abstract types have existential type, ACM Trans. Programming Languages Systems 10, No. 3, 470-502.
30. Mitchell, J. C., and Plotkin, G. D. Also appeared in "Proceedings of the 11 th Annual Symposium on Principles of Programming Languages," pp. 37-51 (1984).
31. Plotkin, G. D. (1975), Call-by-name, call-by-value and the lambda-calculus, Theoret. Comput. Sci. 1, 125-159.
32. Plotkin, G. D. (1981), in "A structural approach to operational semantics," Technical Report, DAIMI FN-19, Arhus University.
33. 3 report on the algorithmic language Scheme, SIGPLAN Not. 21, No. 12, 37-79.
34. Reppy, J. H. (1991), "Higher-Order Concurrency, Ph. D. Thesis, Cornell University.
35. Reynolds, J. (1972), Definitional interpreters for higher order programming languages, in "ACM Conference Proceedings," pp. 717-740.
36. Reynolds, J. C. (1974), On the relation between direct and continuation semantics, in "Proceedings of the International Conference on Automata, Languages, and Programming," pp. 141-156.
37. Scott, D. (1976), Data types as lattices, SI AM J. Comput. 3, No. 5, 522-586.
38. Seldin, J. P. (1977), A sequent calculus for type assignment, J. Symbolic Logic 42, 11-28.
39. Standard ML of New Jersey (1991), Release notes (version0.75), AT&T Bell Laboratories.
40. Talpin, J.-P., and Jouvelot, P. (1991), "The Type and Effect Discipline," Technical Report EMP-CRI A/206, Ecole des Mines de Paris.
41. Tofte, M. (1987), "Operational Semantics and Polymorphic Type Inference," Ph.D. Thesis, University of Edinburgh.
42. Tofte, M. (1990), Type inference for polymorphic references, Inform. Comput. 89, 1-34.
43. Wright, A. K. (1992), Typing references by effect inference, in "Proceedings of the European Symposium on Programming," pp. 473-491, Lecture Notes in Computer Science, Vol. 582, Springer-Verlag, Berlin/New York.