37 search results - page 2 / 8 » Subtyping Constraints in Quasi-lattices |
93
Voted
JFP
2006
15 years 6 days ago
2006
We investigate a technique from the literature, called the phantom-types technique, that uses parametric polymorphism, type constraints, and unification of polymorphic types to mo...
ISSTA
2004
ACM
15 years 5 months ago
2004
ACM
Constraints in predicate or relational logic can be translated into boolean logic and solved with a SAT solver. For faster solving, it is common to exploit the typing of predicate...
70
Voted
APLAS
2003
ACM
2003
ACM
Type Inference with Structural Subtyping: A Faithful Formalization of an Efficient Constraint Solver
15 years 5 months ago
71
Voted
FSTTCS
2003
Springer
15 years 5 months ago
2003
Springer
104
Voted
ESOP
1992
Springer
15 years 4 months ago
1992
Springer
Dynamic typing is a program analysis targeted at removing runtime tagging and untagging operations from programs written in dynamically typed languages. This paper compares dynami...