Quantifier Elimination and Parametric Polymorphism in Programming Languages (1992)

Cached

Download Links

by Harry G. Mairson
Venue:J. Functional Programming
Citations:4 - 2 self

Documents Related by Co-Citation

20 The inherent computational complexity of theories of ordered sets – A R Meyer - 1974
26 The typed ^.-calculus is not elementary recursive – R Statman - 1979
45 The definition of Standard ML – R Harper, R Milner, M Tofte - 1990
361 Towards a theory of type structure, in – J C Reynolds - 1974
935 A theory of type polymorphism in programming – Robin Milner - 1978
26 The Expressiveness of a Family of Finite Set Languages – Neil Immerman, Sushant Patnaik, David Stemple - 1991
5 The Hierarchy of Finitely Typed Functional Programs – A Kfoury, J Tiuryn, P Urzyczyn - 1987
11 Definierbare funktionen im #-kalkul mit typen – H Schwichtenberg - 1976
6 On the Complexity of Queries in – G Kuper, M Y Vardi - 1993
12 Functional Database Query Languages as Typed Lambda Calculi of Fixed Order (Extended Abstract) – Gerd G. Hillebrand, Paris C. Kanellakis - 1994
33 The expressiveness of simple and second-order type structures – S Fortune, D Leivant, M O'Donnell
44 On the expressive power of database queries with intermediate types – Richard Hull, Jianwen Su - 1991
50 Algebras of feasible functions – Yuri Gurevich - 1983
20 A simple proof of a theorem of Statman – Harry G. Mairson - 1992
38 Lambda calculus characterizations of poly-time – D Leivant, J-Y Marion
8 Finite Model Theory In The Simply Typed Lambda Calculus – Gerd G. Hillebrand - 1994
25 Database Query Languages Embedded in the Typed Lambda Calculus – Gerd Hillebrand , Paris C. Kanellakis, Harry G. Mairson - 1993
2331 Monotone Complexity – Michelangelo Grigni , Michael Sipser - 1990
243 Structure and Complexity of Relational Queries – Ashok Chandra, David Harel - 1982