Types Hongwei Xi Boston University Work partly funded by NSF grants no. CCR-0229480 and no. CCF-0702665 and General Theoretical Account for Abstract Types – p.1/20
In this paper, it is shown that the Hilbert series of a Borel type ideal may be computed within a complexity which is polynomial in Dn where n + 1 is the number of unknowns and D ...
Abstract. This paper extends the logical approach to computable analysis via Σ–definability to higher type continuous data such as functionals and operators. We employ definab...
This paper describes the user interface design and evaluation of TransType, a system that watches over the user as he or she types a translation and repeatedly suggests completions...
Abstract. We present a constraint system OF of feature trees that is appropriate to specify and implement type inference for first-class messages. OF extends traditional systems of...