Sciweavers

1313 search results - page 72 / 263
» Generic Universe Types
Sort
View
POPL
1997
ACM
15 years 4 months ago
Type-Checking Higher-Order Polymorphic Multi-Methods
We present a new predicative and decidable type system, called ML , suitable for languages that integrate functional programming and parametric polymorphism in the tradition of ML...
François Bourdoncle, Stephan Merz
FOCS
1992
IEEE
15 years 4 months ago
Efficient Inference of Partial Types
Partial types for the -calculus were introduced by Thatte in 1988 [3] as a means of typing objects that are not typable with simple types, such as heterogeneous lists and persiste...
Dexter Kozen, Jens Palsberg, Michael I. Schwartzba...
ICNP
2005
IEEE
15 years 5 months ago
Typed Abstraction of Complex Network Compositions
straction of Complex Network Compositions∗ Azer Bestavros, Adam D. Bradley, Assaf J. Kfoury, and Ibrahim Matta Department of Computer Science Boston University The heterogeneity...
Azer Bestavros, Adam Bradley, Assaf J. Kfoury, Ibr...
ESOP
2006
Springer
15 years 3 months ago
Step-Indexed Syntactic Logical Relations for Recursive and Quantified Types
We present a sound and complete proof technique, based on syntactic logical relations, for showing contextual equivalence of expressions in a -calculus with recursive types and imp...
Amal J. Ahmed
CHI
2006
ACM
16 years 8 days ago
Visual search and reading tasks using ClearType and regular displays: two experiments
Two experiments comparing user performance on ClearType and Regular displays are reported. In the first, 26 participants scanned a series of spreadsheets for target information. S...
Andrew Dillon, Lisa Kleinman, Gil Ok Choi, Randolp...