Skip to main content
SpringerLink
Log in
Book cover

Logic and Computer Science pp 111–150Cite as

A guide to polymorphic types

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Mathematics ((LNMCIME,volume 1429))

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   29.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   39.95
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Amadio, R., Bruce, K.B., Longo, G. The finitary projection model for second-order lambda calculus and solutions to higher-order domain equations. Proc 1st IEEE Symposium on Logic in Computer Science, Cambridge, Mass., June 1986.

    Google Scholar 

  2. Bainbridge, E.S., Freyd, P.J., Scedrov, A., Scott, P.J. Functorial polymorphism. In: Logical Foundations of Functional Programming, Proceedings University of Texas Programming Institute, Austin, Texas, June 1987, ed. by G. Huet, to appear.

    Google Scholar 

  3. Barendregt, H. The lambda calculus. Its syntax and semantics. Revised edition, North-Holland, Amsterdam, 1984.

    MATH  Google Scholar 

  4. Barendregt, H. Lambda calculi with types. In: Handbook of logic in computer science, ed. by S. Abramsky et al., Oxford Univ. Press, to appear.

    Google Scholar 

  5. Barnes, J.G.P. Programming in Ada. Addison-Wesley, 1981.

    Google Scholar 

  6. Breazu-Tannen, V. Combining algebra and higher types. Proc. 3rd IEEE Symposium on Logic in Computer Science, Edinburgh, Scotland July 1988.

    Google Scholar 

  7. Breazu-Tannen, V., Buneman, O.P., Gunter, C.A. Typed functional programming for rapid development of reliable software. Proc. ACM Symposium on Productivity: Prospects, Progress, and Payoff. Washington, D.C. chapter of the ACM, June 1988.

    Google Scholar 

  8. Breazu-Tannen, V., Coquand, T. Extensional models for polymorphism. Proc. TAPSOFT '87-CFLP, Pisa. Springer LNCS 250. Expanded version to appear in Theor. Comp. Science.

    Google Scholar 

  9. Breazu-Tannen, V., Meyer, A.R. Computable values can be classical. Proc. 14th Annual ACM Symposium on Principles of Programming Languages, Munich, West Germany, January 1987.

    Google Scholar 

  10. Bruce, K.B., Longo, G. A modest model of records, inheritance, and bounded quantification. Proc. 3rd IEEE Symposium on Logic in Computer Science, Edinburgh, Scotland, July 1987.

    Google Scholar 

  11. Bruce, K.B., Meyer, A.R., Mitchell, J.C., The semantics of second-order lambda calculus. Information and Computation, to appear.

    Google Scholar 

  12. Carboni, A., Freyd, P., Scedrov, A. A categorical approach to realizability and polymorphic types. Proc. 3rd ACM Workshop on the Mathematical Foundations of the Programming Language Semantics, New Orleans, April, 1987, ed. by M. Main et al., Springer LNCS 298, 1988, pp. 23–42.

    Google Scholar 

  13. Cardelli, L. Time for a new language. Preprint, April 1988.

    Google Scholar 

  14. Constable, R.L., et al. Implementing mathematics with the NUPRL proof development system. Prentice Hall, 1986.

    Google Scholar 

  15. Coquand, T. Une théorie des constructions. Thèse de troisème cycle, Université Paris VII.

    Google Scholar 

  16. Coquand, T., Huet, G. Constructions: a higher-order proof system for mechanizing mathematics. Proc. EUROCAL '85, Springer LNCS 203, pp. 151–184.

    Google Scholar 

  17. Coquand, T., Huet, G. Concepts mathématiques et informatiques formalisés dans le calcul des constructions. In: Logic Colloquium 85 (ed. by The Paris Logic Group), North-Holland, Amsterdam, 1987.

    Google Scholar 

  18. Coquand, T., Gunter, C.A., Winskel, G. dI-domains as a model of polymorphism. Proc. 3rd ACM Workshop on the Mathematical Foundations of the Programming Language Semantics, New Orleans, April 1987, ed. by M. Main et al., Springer LNCS 298, 1988, pp. 344–363.

    Google Scholar 

  19. Coquand, T., Gunter, C.A., Winskel, G. Domain theoretic models for polymorphism. Information and Computation, to appear.

    Google Scholar 

  20. Cousineau, G. CAML. Lectures at the University of Texas Programming Institute on the Logical Foundations of Functional Programming, Austin, Texas, June 1987.

    Google Scholar 

  21. Cousineau, G., Curien, P.L., Robinet, B. (eds.), "Combinators and Functional Programming Languages". Springer LNCS 242.

    Google Scholar 

  22. Curien, P.L., Categorical combinators, sequential algorithms, and functional programming. Research notes in theoretical computer science, Pitman, 1986.

    Google Scholar 

  23. de Bruijn, N.G. Lambda calculus notation with nameless dummies, a tool for automatic formula manipulation. Indagationes Math. 34 (1972) pp. 381–392.

    Article  MATH  Google Scholar 

  24. Freyd, P., Scedrov, A. Some semantic aspects of polymorphic lambda calculus. Proc. 2nd IEEE Symposium on Logic in Computer Science, Ithaca, NY, 1987, pp. 315–319.

    Google Scholar 

  25. Freyd, P.J., Girard, J.Y., Scedrov, A., Scott, P.J. Semantic parametricity in polymorphic lambda calculus. Proc. 3rd IEEE Symposium on Logic in Computer Science, Edinburgh, Scotland, July 1988.

    Google Scholar 

  26. Giannini, P., Honsell, F., Ronchi Della Rocca, S. A strongly normalizing term having no type in the system F (second-order λ-calculus). Rapporto Interno, Dipartimento di Informatica, Università di Torino, 1987.

    Google Scholar 

  27. Giannini, P., Ronchi Della Rocca, S. Characterization of typing in polymorphic type discipline. Proc. 3rd IEEE Symposium on Logic in Computer Science, Edinburgh, Scotland, July 1988.

    Google Scholar 

  28. Girard, J.Y., Une extension de l'interprétation de Gödel … In: Second Scandinavian Logic Symposium, 1970, ed. by J.E. Fenstad, North-Holland, Amsterdam, 1971.

    Google Scholar 

  29. Girard, J.Y. Interprétation fonctionelle et élimination des coupures de l'arithmétique d'ordre supérieur. These de Doctorat d'Etat, Université Paris VII, 1972.

    Google Scholar 

  30. Girard, J.Y. The system F of variable types, fifteen years later. Theor. Comp. Science 45 (1986) pp. 159–192.

    Article  MathSciNet  MATH  Google Scholar 

  31. Girard, J.Y. Linear logic. Theor. Comp. Science 50 (1987) pp. 1–102.

    Article  MathSciNet  MATH  Google Scholar 

  32. Girard, J.Y. Proof theory and logical complexity. Studies in proof theory, Bibliopolis, Napoli, 1987.

    Google Scholar 

  33. Gordon, M.J.C., Milner, R., Wadsworth, C. Edinburgh LCF. Springer LNCS 78, 1979.

    Google Scholar 

  34. Gunter, C.A., Scott, D.S. Semantic domains. In: Handbook of Theoretical Computer Science, ed. by J. van Leeuwen, North-Holland, Amsterdam, to appear.

    Google Scholar 

  35. Hindley, J.R., Seldin, J.P. Introduction to combinators and lambda calculus. Cambridge University Press, 1986.

    Google Scholar 

  36. Howard, W.A. The formulae-as-types notion of construction. Unpublished manuscript, 1969. Reprinted in: To H.B. Curry: Essays on combinatory logic, lambda calculus, and formalism. J.P. Seldin and J.R. Hindley, eds., Academic Press, 1980.

    Google Scholar 

  37. Huet, G. Confluent reductions: abstract properties and applications to term rewriting systems. J.A.C.M. 27 (1980) pp. 797–821.

    MathSciNet  MATH  Google Scholar 

  38. Huet, G. Deduction and computation. In: Fundamentals in Artificial Intelligence, eds. W. Bibel and P. Jorrand, Springer LNCS 232, 1986.

    Google Scholar 

  39. Huet, G. A uniform approach to type theory. In: Logical Foundations of Functional Programming, Proceedings University of Texas Programming Institute, Austin, Texas, June 1987, ed. by G. Huet, to appear.

    Google Scholar 

  40. Huet, G., and Lévy, J.J. Call by need computations in nonambiguous linear term rewriting systems. Rapport Laboria 359, IRIA, August 1979.

    Google Scholar 

  41. Hyland, J.M.E. A small complete category. Preprint, 1987.

    Google Scholar 

  42. Hyland, J.M.E., Robinson, E.P., Rosolini, G. The discrete objects in the Effective Topos. Preprint, 1987.

    Google Scholar 

  43. Hyland, J.M.E., Pitts, A. The theory of constructions: categorical semantics and topos-theoretic models. In: Categories in Computer Science and Logic, Proceedings Amer. Math. Soc. Research Conference, Boulder, Colorado, June 1987, ed. by J.W. Gray and A. Scedrov, to appear.

    Google Scholar 

  44. Klop, J.W. Combinatory reduction systems. Ph.D. Dissertation, Mathematisch Centrum Amsterdam, 1980.

    Google Scholar 

  45. Krivine, J.L. Un algorithme non typable dans le système F. Compt. Rend. Acad. Sci. Paris, Ser. I, Math. 304 No. 5 (1987) pp. 123–126.

    MathSciNet  MATH  Google Scholar 

  46. Lamarche, F. A model for the theory of constructions. In: Categories in Computer Science and Logic, Proceedings Amer. Math. Soc. Research Conference, Boulder, Colorado, June 1987, ed. by J.W. Gray and A. Scedrov, to appear.

    Google Scholar 

  47. Lambek, J., Scott, P.J. Introduction to higher-order categorical logic. Cambridge University Press.

    Google Scholar 

  48. Leivant, D. Reasoning about functional programs and complexity classes associated with type disciplines. 24th Annual IEEE Symposium on Foundations of Computer Science, 1983.

    Google Scholar 

  49. Lévy, J.J. Réductions correctes et optimales dans le λ-calcul. Thèse d'Etat, Université de Paris VII, 1978.

    Google Scholar 

  50. Liskov, B. et al. Clu reference manual. Springer LNCS 114, 1981.

    Google Scholar 

  51. Longo, G., Moggi, E. Constructive natural deduction and its "modest" interpretation. Workshop on semantics of natural and computer languages, Stanford, March 1987, ed. by J. Meseguer et al., M. I. T. Press, to appear.

    Google Scholar 

  52. MacQueen, D. Modules for Standard ML. Polymorphism Newsletter 2(2), 1985.

    Google Scholar 

  53. Martin-Löf, P. Intuitionistic type theory. Studies in proof theory, Bibliopolis, Napoli, 1984.

    Google Scholar 

  54. McCracken, N. An investigation of a programming language with polymorphic type structure. Ph.D. Dissertation, Syracuse University, 1979.

    Google Scholar 

  55. Meseguer, J. Relating models of polymorphism. Technical note SRI-CSL-TN88-1, SRI International, June 1988.

    Google Scholar 

  56. Meyer, A.R. Invited lecture at the 3rd IEEE Symposium on Logic in Computer Science, Edinburgh, July, 1988.

    Google Scholar 

  57. Milner, R. A proposal for standard ML. In: ACM Symposium on LISP and Functional Programming, 1984, pp. 184–197.

    Google Scholar 

  58. Mitchell, J.C. Type inference and type containment. In: Symp. on Semantics of Data Types. Springer LNCS 173, 1984, pp. 257–278, revised version to appear in Information and Computation.

    MathSciNet  MATH  Google Scholar 

  59. Mitchell, J.C. A type-inference approach to reduction properties and semantics of polymorphic expressions. In: Proc. 1986 ACM Symposium on Lisp and Functional Programming, pp. 308–319.

    Google Scholar 

  60. Mitchell, J.C., Meyer, A.R. Second-order logical relations. In: Logics of Programs, ed. by. R. Parikh, Springer LNCS 193, 1985, pp. 225–236.

    MathSciNet  MATH  Google Scholar 

  61. Mitchell, J.C., Plotkin, G.D. Abstract types have existential types. In: Proc. 12th ACM Symposium on Principles of Programming Languages, January 1985, pp. 37–51.

    Google Scholar 

  62. Moggi, E. Dissertation, Edinburgh University. In preparation.

    Google Scholar 

  63. Mohring, C. Algorithm development in the calculus of constructions. Proc. 1st IEEE Symposium on Logic in Computer Science, Cambridge, Mass., 1986, pp. 84–91.

    Google Scholar 

  64. Pitts, A. Polymorphism is set-theoretic, constructively. Symposium on Category Theory and Computer Science, Springer LNCS 283, 1987.

    Google Scholar 

  65. Plotkin, G.D. Denotational semantics with partial functions. Lecture notes, CSLI Summer School, Stanford, 1985.

    Google Scholar 

  66. Pottinger, G. Strong normalization for terms of the theory of constructions. Preprint, February 1987.

    Google Scholar 

  67. Prawitz, D. Natural deduction. Almquist and Wiksell, Stockholm, 1965.

    Google Scholar 

  68. Reynolds, J.C. Towards a theory of type structure. Springer LNCS 19, 1974, pp. 408–425.

    MathSciNet  Google Scholar 

  69. Reynolds, J.C. Types, abstraction, and parametric polymorphism. In: Information Processing '83, ed. by R.E.A. Mason. North-Holland, Amsterdam, pp. 513–523.

    Google Scholar 

  70. Reynolds, J.C. Polymorphism is not set-theoretic. Symposium on Semantics of Data Types, ed. by Kahn et al., Springer LNCS 173, 1984.

    Google Scholar 

  71. Reynolds, J.C., Plotkin, G.D. On functors expressible in the polymorphic typed lambda calculus. Preliminary report in: Logical Foundations of Functional Programming, Proceedings University of Texas Programming Institute, Austin, Texas, June 1987, ed. by G. Huet, to appear. Extended version to appear in Information and Computation.

    Google Scholar 

  72. Rosolini, G. About Modest Sets. Preprint, 1986.

    Google Scholar 

  73. Scedrov, A. Recursive realizability interpretation of calculus of constructions. In: Logical Foundations of Functional Programming, Proceedings University of Texas Programming Institute, Austin, Texas, June 1987, ed. by G. Huet, to appear.

    Google Scholar 

  74. Scedrov, A. Normalization revisited. In: Categories in Computer Science and Logic, Proceedings Amer. Math. Soc. Research Conference, Boulder, Colorado, June 1987, ed. by J.W. Gray and A. Scedrov, to appear.

    Google Scholar 

  75. Scott, D.S. Continuous lattices. In: Toposes, Algebraic Geometry and Logic, ed. by F.W. Lawvere, Springer LNM 274, 1972, pp. 97–136.

    MathSciNet  Google Scholar 

  76. Scott, D.S. Data types as lattices. SIAM J. of Computing 5 (1976) pp. 522–587.

    Article  MathSciNet  MATH  Google Scholar 

  77. Scott, D.S. Domains for denotational semantics. ICALP '82, Springer LNCS 140.

    Google Scholar 

  78. Scott, D.S. Realizability and domain theory. Lecture at the Amer. Math. Soc. Research Conference on Categories in Computer Science and Logic, Boulder, Colorado, June 1987.

    Google Scholar 

  79. Seely, R.A.G. Categorical semantics for higher-order polymorphic lambda calculus. J. Symbolic Logic 52 (1987) pp. 969–989.

    Article  MathSciNet  MATH  Google Scholar 

  80. Seely, R.A.G. Modelling computations: a 2-categorical framework. 2nd IEEE Symposium on Logic in Computer Science, Ithaca, NY, pp. 65–71.

    Google Scholar 

  81. Seldin, J. Theory of MATHESIS. Technical Report, Odyssey Research Associates, Inc., March 1987.

    Google Scholar 

  82. Smyth, M.B., Plotkin, G.D. The category-theoretic solution of recursive domain equations. SIAM J. of Computing 11 (1982) pp. 761–783.

    Article  MathSciNet  MATH  Google Scholar 

  83. Statman, R. Number theoretic functions computable by polymorphic programs. 22nd Annual IEEE Symposium on Foundations of Computer Science, 1981.

    Google Scholar 

  84. Stenlud, S. Combinators, λ-terms, and proof theory. Reidel, 1972.

    Google Scholar 

  85. Strachey, C. Fundamental concepts in programming languages. Lecture Notes, International Summer School in Computer Programming, Copenhagen, August 1967.

    Google Scholar 

  86. Tait, W.W. A realizability interpretation of the theory of species. In: Springer LNM 453, 1975, pp. 240–251.

    MathSciNet  Google Scholar 

  87. Takeuti, G. Proof theory. Second edition, North-Holland, Amsterdam, 1987.

    MATH  Google Scholar 

  88. Turner, D.A. Miranda: a non-strict functional language with polymorphic types. In: Functional Pragramming Languages and Computer Architecture, ed. by J.P. Jouannaud, Springer LNCS 201, 1985, pp. 1–16.

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Departments of Mathematics and Computer Science, University of Pennsylvania, USA

    Andre Scedrov

Authors
  1. Andre Scedrov
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Piergiorgio Odifreddi

Rights and permissions

Reprints and permissions

Copyright information

© 1990 Springer-Verlag

About this paper

Cite this paper

Scedrov, A. (1990). A guide to polymorphic types. In: Odifreddi, P. (eds) Logic and Computer Science. Lecture Notes in Mathematics, vol 1429. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0093926

Download citation

  • DOI: https://doi.org/10.1007/BFb0093926

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-52734-3

  • Online ISBN: 978-3-540-47135-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation