Indexed types

Theoretical Computer Science

Volumn 187, Issue 1-2, 1997, Pages 147-165

  Zenger, Christoph ^a  

^a UNIVERSITY OF KARLSRUHE   (Germany)

Author keywords

Constraints; Dependent types; Functional languages; Type inference; Type system

Indexed keywords

CONSTRAINT THEORY; FORMAL LANGUAGES; MATRIX ALGEBRA; VECTORS;

FUNCTIONAL LANGUAGES; TYPE SYSTEMS;

PROGRAMMING THEORY;

EID: 0031276104     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(97)00062-5     Document Type: Article

References (29)

1. B. Buchberger, Gröbner Bases: An algorithmic method in polynomial ideal theory, in: N.K. Bose (Ed.), Recent Trends in Multidimensional Systems Theory, D. Reidel, Dordrecht, 1985, pp. 184-232.
2. R. Bird, P. Wadler, Introduction to Functional Programming, Prentice-Hall, Englewood Cliffs, 1988.
3. T. Becker, V. Weispfenning, Gröbner Bases, Springer, Berlin, 1993.
4. R.L. Constable, S.F. Allen, H.M. Bromley, W.R. Cleaveland, J.F. Cremer, R.W. Harper, D.J. Howe, T.B. Knoblock, N.P. Mendler, P. Panangaden, J.T. Sasaki, S.F. Smith, Implementing Mathematics with the Nuprl Proof Development System, Prentice-Hall, Englewood Cliffs, NJ, 1986.
5. C. Cornes, J. Courant, J. Filiâtre, G. Huet, P. Manoury, C. Munôz, C. Murthy, C. Parent, C. Paulin-Mohring, A. Saïbi, B. Werner, The Coq Proof Assistant Reference Manual. INRIA-Rocquencourt - CNRS - ENS Lyon, 5.10 ed., 1995.
6. D. Cox, J. Little, D. O'Shea, Ideals, Varieties, and Algorithms, Springer, Berlin, 1992.
7. G.E. Collins, Quantifier elimination for real closed fields by cylindric algebraic decomposition, in: 2nd GI Conf. on Automata Theory and Formal Languages, Lecture Notes in Computer Science, vol. 33, Springer, Berlin, 1975.
8. T. Coquand, An algorithm for type-checking dependent types, preprint, March 1996.
9. L. Cardelli, P. Wegner, On understanding types, data abstraction, and polymorphism, ACM Comput. Surveys 17 (1985) 471-522.
10. L. Damas, R. Milner, Principal type-schemes for functional programs, in: Proc. 9th POPL, 1982, pp. 207-212.
11. P. Hudak, S.P. Jones, P. Wadler, editors. Report on the Programming Language Haskell Version 1.2, vol. 27. ACM SIGPLAN, May 1992.
12. J. Hughes, L. Pareto, A. Sabry, Proving the correctness of reactive systems using sized types, in: ACM Symp. Principles of Programming Languages, January 1996.
13. M.P. Jones, An introduction to Gofer, 1994.
14. M.P. Jones, Qualified types: theory and practice, Ph. D. thesis, University of Nottingham, 1994.
15. R.D. Jenks, R.S. Sutor, AXIOM, Springer, Berlin, 1992.
16. G. Kreisel, J.L. Krevine, Elements of Mathematical Logic, North-Holland, Amsterdam, 1967.
17. A.J. Kfoury, J. Tiuryn, P. Urzyczyn, Type reconstruction in the presence of polymorphic recursion, ACM Trans. Programming Languages and Systems 15 (April 1993) 290-311.
18. K. Läufer, Polymorphic type inference and abstract data types, Ph. D Thesis, Department of Computer Science, New York University, July 1992.
19. Z. Luo, R. Pollack, LEGO proof development system: user's manual, Department of Computer Science, University of Edinburgh, 1992.
20. R. Milner, A theory of type polymorphism in programming, J. Comput. System Sci. 17 (1978) 348-375.
21. A. Mycroft, R.A. O'Keefe, A polymorphic type system for Prolog, Artificial Intelligence 23 (1984) 295-307.
22. J. Mitchell, G. Plotkin, Abstract types have existential type, ACM Trans. Programming Languages 10 (1988) 470-502.
23. M. Odersky, K. Läufer, Putting type annotations to work, in: Proc. 23rd ACM Symp. Principles of Programming Languages (January 1996) pp. 65-67.
24. N. Perry, The implementation of practical functional programming languages, Ph. D. Thesis, Imperial College of Science, Technology, and Medicine, University of London, 1990.
25. S. Peyton-Jones (Ed.) Implementation of Functional Languages, Prentice-Hall, Englewood Cliffs, NJ, 1990.
26. M. Sulzmann, Typinferenz mit Constraints (German), Master's Thesis, University of Karlsruhe, Mai 1996.
27. D.A. Turner, Recursion equations as a programming language, in: Darlington et al. (Ed.) Functional Programming and Its Applications, Cambridge Univ. Press, Cambridge, 1982.
28. P. Wadler, Deforestation: Transforming programs to eliminate trees, Theoret. Comput. Sci. 73 (1990) 231-248.
29. P. Wadler, S. Blott, How to make ad-hoc polymorphism less ad-hoc, in: Proc. 16th ACM Symp. Principles of Programming Languages, 1989, pp. 60-76.