Sciweavers

37 search results - page 2 / 8
» Subtyping Constraints in Quasi-lattices
Sort
View
JFP
2006
103views more  JFP 2006»
14 years 10 months ago
Phantom types and subtyping
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...
Matthew Fluet, Riccardo Pucella
ISSTA
2004
ACM
15 years 3 months ago
Faster constraint solving with subtypes
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...
Jonathan Edwards, Daniel Jackson, Emina Torlak, Vi...
63
Voted
FSTTCS
2003
Springer
15 years 3 months ago
Subtyping Constraints in Quasi-lattices
Emmanuel Coquery, François Fages
ESOP
1992
Springer
15 years 2 months ago
Dynamic Typing
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...
Fritz Henglein