1620 search results - page 6 / 324 » Testing Polymorphic Properties |
CP
2010
Springer
14 years 10 months ago
2010
Springer
We study the expressibility problem: given a finite constraint language Γ on a finite domain and another relation R, can Γ express R? We prove, by an explicit family of example...
APAQS
2000
IEEE
15 years 4 months ago
2000
IEEE
Although quality is not easy to evaluate since it is a complex concept compound by different aspects, several properties that make a good object-oriented design have been recogniz...
LICS
2006
IEEE
15 years 5 months ago
2006
IEEE
We show that typability for a natural form of polymorphic recursive typing for rank-2 intersection types is undecidable. Our proof involves characterizing typability as a context ...
107
click to vote
JACM
2007
14 years 11 months ago
2007
This paper extends the termination proof techniques based on reduction orderings to a higher-order setting, by defining a family of recursive path orderings for terms of a typed ...
102
click to vote
FOSSACS
2008
Springer
15 years 1 months ago
2008
Springer
We introduce Erasure Pure Type Systems, an extension to Pure Type Systems with an erasure semantics centered around a type constructor indicating parametric polymorphism. The eras...