Indexed Types

[1]  David A. Cox,et al.  Ideals, Varieties, and Algorithms , 1997 .

[2]  M. Felleisen,et al.  on the Principles of Programming Languages , 1997 .

[3]  Thierry Coquand,et al.  An Algorithm for Type-Checking Dependent Types , 1996, Sci. Comput. Program..

[4]  Martin Odersky,et al.  Putting type annotations to work , 1996, POPL '96.

[5]  Amr Sabry,et al.  Proving the correctness of reactive systems using sized types , 1996, POPL '96.

[6]  Martin Odersky,et al.  Polymorphic type inference and abstract data types , 1994, TOPL.

[7]  Mark P. Jones.  Qualified Types: Theory and Practice , 1994 .

[8]  Jerzy Tiuryn,et al.  Type reconstruction in the presence of polymorphic recursion , 1993, TOPL.

[9]  Philip Wadler,et al.  How to make ad-hoc polymorphism less ad hoc , 1989, POPL '89.

[10]  John C. Mitchell,et al.  Abstract types have existential type , 1988, TOPL.

[11]  Richard S. Bird,et al.  Introduction to functional programming , 1988, Prentice Hall International series in computer science.

[12]  Philip Wadler,et al.  Deforestation: Transforming Programs to Eliminate Trees , 1990, Theor. Comput. Sci..

[13]  Rance Cleaveland,et al.  Implementing mathematics with the Nuprl proof development system , 1986 .

[14]  Luca Cardelli,et al.  On understanding types, data abstraction, and polymorphism , 1985, CSUR.

[15]  B. Buchberger,et al.  Grobner Bases : An Algorithmic Method in Polynomial Ideal Theory , 1985 .

[16]  B. Buchberger.  An Algorithmic Method in Polynomial Ideal Theory , 1985 .

[17]  Alan Mycroft,et al.  A Polymorphic Type System for Prolog , 1984, Logic Programming Workshop.

[18]  Robin Milner,et al.  Principal type-schemes for functional programs , 1982, POPL '82.

[19]  Robin Milner,et al.  A Theory of Type Polymorphism in Programming , 1978, J. Comput. Syst. Sci..

[20]  George E. Collins,et al.  Quantifier elimination for real closed fields by cylindrical algebraic decomposition , 1975 .

[21]  Olgierd Wojtasiewicz,et al.  Elements of mathematical logic , 1964 .