Functorial ML

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1140, Issue , 1996, Pages 32-46

  Belle G ^b   Jay, C B ^a   Moggi, E ^b  

^a UNIVERSITY OF TECHNOLOGY SYDNEY   (Australia)

^b UNIVERSITY OF GENOA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL LINGUISTICS;

FUNCTORS; SHAPE THEORY; TYPE INFERENCES; TYPE SYSTEMS;

ALGEBRA;

EID: 80054955211     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61756-6_75     Document Type: Conference Paper

References (27)

1. P. Aczel. A general Church-Rosser theorem. Technical report, Univ. of Manchester, 1978.
2. H.P. Barendregt. The Lambda Calculus: Its Syntax and Semantics. North Holland, 1984. revised edition.
3. H.P. Barendregt. Lambda calculi with types. In Handbook of Logic in Computer Science. Oxford Univ. Press, 1992.
4. J. Benabou. Introduction to bicategories, volume 47. Springer, 1967.
5. E.S. Bainbridge, P.J. Freyd, A. Scedrov, and P.J. Scott. Functorial polymorphism. Theoretical Computer Science, 70:35-64, 1990.
6. G. Belle, C. B. Jay, and E. Moggi. Functorial ML. available from ftp://ftp.disi.unige.it/person/MoggiE/functorial_ml.dvi, 1996.
7. M. Barr and C. Wells. Category Theory for Computing Science. International Series in Computer Science. Prentice Hall, 1990.
8. J.R.B. Cockett and T. Fukushima. About charity. Technical Report 92/480/18, University of Calgary, 1992.
9. J.-Y. Girard, Y. Lafont, and P. Taylor. Proofs and Types, volume 7. CUP, 1989.
10. R. Harper and G. Morrisett. Compiling polymorphism using intensional type analysis. In Conference Record of POPL '95: 22nd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 130-141, San FVancisco, California, January 1995.
11. C.B. Jay. Type-free term reduction for covariant types. Tech. report to appear.
12. C.B. Jay. Polynomial polymorphism. In R. Kotagiri, editor, Proceedings of the Eighteenth Australasian Computer Science Conference: Glenelg, South Australia 1-3 February, 1995, volume 17, pages 237-243. A.C.S. Communications, 1995.
13. C.B. Jay. A semantics for shape. Science of Computer Programming, 25:251-283, 1995.
14. C.B. Jay. Shape analysis for parallel computing. In Parallel Computing Workshop '95 at Fujitsu Parallel Computing Centre, Imperial College, 1995.
15. C.B. Jay. A fresh look at parametric polymorphism: covariant types. In Proceedings of the 19th Australasian Computer Science Conference, Melbourne, Australia, January 31-February 2 1996., pages 525-533, 1996.
16. J. Jeuring. Polytypic pattern matching. In Conference on Functional Programming Languages and Computer Architecture, pages 238-248, 1995.
17. M.P. Jones. A system of constructor classes: overloading and implicit higher- order polymorphism. J. of Functional Programming, 5(1), 1995.
18. J. W. Klop. Combinatory Reduction Systems. PhD thesis, Mathematical Center Amsterdam, 1980. Tracts 129.
19. X. Leroy. Unboxed objects and polymorphic typing. In 19th Symp. on Principle of Programming Languages. ACM Press, 1992.
20. J. Lambek and P.J. Scott. Introduction to Higher-Order Categorical Logic, volume 7 of Cambridge Studies in Advanced Mathematics. Cambridge University Press, 1986.
21. N.P. Mendler. Inductive types and type constraints in the second-order lambda calculus. Annals of Pure and Applied Logic, 51, 1991.
22. E. Meijer, M. Fokkinga, and R. Paterson. Functional programming with bananas, lenses, envelopes and barbed wire. In J. Hughes, editor, Proceeding of the 5th ACM Conference on Functional Programming and Compter Architecture, volume 523 of LNCS, pages 124-44. Springer Verlag, 1991.
23. E. Meijer and G. Hutton. Bananas in space: extending fold and unfold to exponential types. In Procedings 7th International Conference on Functional Programming and Computer Architecture, San Diego, California, June 1995. ACM Press, 1995.
24. R. Milner. A theory of type polymorphism in programming. JCSS, 17, 1978.
25. S. Peyton Jones. Unboxed values as first-class citizens. In Functional Programming and Computer Architecture, volume 523 of LNCS, 1991.
26. J. Reynolds and G.D. Plotkin. On functors expressible in polymorphic lambda-calculus. In G. Huet, editor, Logical Foundations of Functional Programming. Addison-Wesley, 1990.
27. M. Tofte. Operational Semantics and Polymorphic Type Inference. PhD thesis, University of Edinburgh, 1988. available as CST-52-88.