37 search results - page 2 / 8 » Subtyping Constraints in Quasi-lattices |
JFP
2006
13 years 7 months 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
14 years 27 days 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...
APLAS
2003
ACM
2003
ACM
Type Inference with Structural Subtyping: A Faithful Formalization of an Efficient Constraint Solver
14 years 22 days ago
FSTTCS
2003
Springer
14 years 20 days ago
2003
Springer
ESOP
1992
Springer
13 years 11 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...