Hierarchies of Decidable Extensions of Bounded Quantification (1994)

Cached

Download Links

by Sergei Vorobyov
Venue:IN 22ND ACM SYMP. ON PRINCIPLES OF PROGRAMMING LANGUAGES
Citations:7 - 5 self

Documents Related by Co-Citation

102 Bounded Quantification is Undecidable – Benjamin C. Pierce - 1993
756 On understanding types, data abstraction, and polymorphism – Luca Cardelli, Peter Wegner - 1985
116 Inheritance As Implicit Coercion – Val Breazu-tannen, Thierry Coquand, Carl A. Gunter, Andre Scedrov - 1991
6 F : Bounded quantification is NOT essentially undecidable – S Vorobyov - 1994
110 An extension of system F with subtyping – Luca Cardelli, Simone Martini, John C. Mitchell, Andre Scedrov - 1991
26 Decidable Bounded Quantification – Giuseppe Castagna , Benjamin C. Pierce - 1994
87 A modest model of records, inheritance, and bounded quantification – Kim B Bruce, Giuseppe Longo
61 Coherence of subsumption, minimum typing and the type checking – P L Curien, G Ghelli - 1992
58 Decidable theories – M Rabin - 1977
114 Decidability of second order theories and automata on infinite trees – M O Rabin - 1969
35 Safe and decidable type checking in an object-oriented language – Kim B. Bruce, Jon Crabtree, Thomas P. Murtagh, Robert Van Gent, Williamstown Ma, Allyn Dimock, Robert Muller - 1993
3 Extensions of... with Decidable Typing – Sergei G. Vorobyov - 1994
14 Completely Bounded Quantification is Decidable – Dinesh Katiyar, Sriram Sankar - 1992
25 Bounded Existentials and Minimal Typing – Giorgio Ghelli, Benjamin Pierce - 1996
54 Programming objects with ML-ART: an extension to ML with abstract and record types – D Rémy - 1994
59 Complete Theories – A Robinson - 1956
69 Undecidable theories – A Tarski, A Mostowski, R M Robinson - 1953
4 Subtyping F-bounded types – Dinesh Katiyar, Sriram Sankar - 1992
1 Logic and Computer Scuence, volume 31 of APIC Studies in Data Processing, chapter On Girard's "candidats de reductibilit'e – J H Gallier - 1990