Theorems for free!

Proceedings of the 4th International Conference on Functional Programming Languages and Computer Architecture, FPCA 1989

Volumn , Issue , 1989, Pages 347-359

  Wadler, Philip ^a  

^a UNIVERSITY OF GLASGOW   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

CALCULATIONS; COMPUTER ARCHITECTURE; COMPUTER PROGRAMMING LANGUAGES; DIFFERENTIATION (CALCULUS);

POLYMORPHIC FUNCTIONS; POLYMORPHIC LAMBDA CALCULUS; REYNOLDS; THEOREMS FOR FREE;

FUNCTIONAL PROGRAMMING;

EID: 84944106308     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/99370.99404     Document Type: Conference Paper

References (29)

1. V. Breazu-Tannen, T. Coquand, C. A. Gunter, and A. Scedrov, Inheritance and explicit coercion. In 4 'th Annual Symposium on Logic in Computer Science, Asilomar, California, June 1989.
2. E. S. Bainbridge, P. J. Freyd, A. Scedrov, and P. J. Scott, Functorial polymorphism. In G. Huet, editor, Logical Foundations of Functional Programming, Austin, Texas, 1987. Addison-Wesley, to appear.
3. K. B. Bruce and A. R. Meyer, The semantics of second-order polymorphic lambda calculus. In Kahn, MacQueen, and Plotkin, editors, Semantics of Data Types, Sophia-Antipolis, France, 1984, pp. 131-144. LNCS 173, Springer-Verlag.
4. V. Breazu-Tannen and T. Coquand, Exten-sional models for polymorphism. Theoretical Computer Science, 59:85-114, 1988.
5. G. Barrett and P. Wadler, Derivation of a pattern-matching compiler. Manuscript, Programming Research Group, Oxford, 1986.
6. R. Bird and P. Wadler, Introduction to Functional Programming. Prentice Hall, 1988.
7. L. Damas and R. Milner, Principal type schemes for functional programs. In Proceedings of the 9'th Annual Symposium on Principles of Programming Languages, Albuquerque, N.M., January 1982.
8. P. J. deBruin, Naturalness of polymorphism. Submitted to Category Theory and Computer Science, Manchester, 1989.
9. P. J. Freyd, J. Y. Girard, A. Scedrov, and P. J. Scott, Semantic parametricity in polymorphic lambda calculus. In S'rd Annual Symposium on Logic in Computer Science, Edinburgh, Scotland, June 1988.
10. S. Fortune, D. Leivant, and M. O'Donnell, The expressiveness of simple and second-order type structures. Journal of the ACM, 30(1):151-185, January 1983.
11. J.-Y. Girard, Interpretation functionelle et élimination des coupures dans l'arithmétique d'ordre supérieure. Ph.D. thesis, Université Paris VII, 1972.
12. J.-Y. Girard, The system F of variable types, fifteen years later. Theoretical Computer Science, 45, pp.159-192.
13. J.-Y. Girard, Y. La fon t, and P. Taylor, Proofs and Types. Cambridge University Press, 1989.
14. R. Hindley, The principal type scheme of an object in combinatory logic. Trans. Am. Math. Soc. 146, pp. 29-60, December 1969.
15. P. Hudak and P. Wadler, editors, Report on the Functional Programming Language Haskell. Technical Report YALEU/DCS/ RR656, Yale University, Department of Computer Science, December 1988; also Technical Report, Glasgow University, Department of Computer Science, December 1988.
16. J. Meseguer, Relating models of polymorphism. In 16'th ACM Symposium on Principles of Programming Languages, Austin, Texas, January 1989.
17. R. Milner, A theory of type polymorphism in programming. J. Comput. Syst. Sei. 17, pp. 348-375, 1978.
18. R. Milner, A proposal for Standard ML. In ACM Symposium on Lisp and Functional Programming, Austin, Texas, August 1984.
19. R. Milner, Changes to the Standard ML core language. Report ECS-LFCS-87-33, Edinburgh University, Computer Science Dept., 1987.
20. J. C. Mitchell, Representation independence and data abstraction. In lS'th ACM Symposium on Principles of Programming Languages, pp. 263-276.
21. J. C. Mitchell and A. R. Meyer, Second-order logical relations. In R. Parikh, editor, Logics of Programs, Brooklyn, New York, 1985. LNCS 193, Springer-Verlag.
22. A. M. Pitts, Polymorphism is set theoretic, constructively. In D. H. Pitt, et al.y editors, Category Theory and Computer Science, Edinburgh, 1987. LNCS 283, Springer-Verlag.
23. J. C. Reynolds, Towards a theory of type structure. In B. Robinet, editor, Proc. Colloque sur la Programmation, LNCS 19, Springer-Verlag.
24. J. C. Reynolds, Types, abstraction, and parametric polymorphism. In R. E. A. Mason, editor, Information Processing 83, pp. 513-523. North-Holland, Amsterdam.
25. J. C. Reynolds, Polymorphism is not set theoretic. In Kahn, MacQueen, and Plotkin, editors, Semantics of Data Types, Sophia-Antipolis, France, 1984, pp. 145-156. LNCS 173, Springer-Verlag.
26. J. C. Reynolds, Three approaches to type structure. In Mathematical Foundations of Software Development, LNCS 185, Springer-Verlag, 1985.
27. M. Sheeran, Categories for the working hardware designer. In Workshop on Hardware Specification, Verification, and Synthesis: Mathematical Aspects, Cornell, July 1989.
28. D. A. Turner, Miranda: A non-strict functional language with polymorphic types. In Proceedings of the S'nd International Conference on Functional Programming Languages and Computer Architecture, Nancy, France, September 1985. LNCS 201, Springer-Verlag, 1985.
29. P. Wadler and S. Blott, How to make ad-hoc polymorphism less ad hoc. In 16'th ACM Symposium on Principles of Programming Languages, Austin, Texas, January 1989.