1321 search results - page 3 / 265 » Subtyping in Logical Form |
68
Voted
FSTTCS
2000
Springer
15 years 1 months ago
2000
Springer
ICFP
2003
ACM
15 years 9 months ago
2003
ACM
We propose a conservative extension of HM(X), a generic constraint-based type inference framework, with bounded existential (a.k.a. abstract) and universal (a.k.a. polymorphic) da...
110
click to vote
POPL
1991
ACM
15 years 28 days ago
1991
ACM
We investigate the interactions of subtyping and recursive types, in a simply typed λ-calculus. The two fundamental questions here are whether two (recursive) types are in the su...
ISSTA
2004
ACM
15 years 2 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...
101
click to vote
CSL
2008
Springer
14 years 11 months ago
2008
Springer
Abstract. We present a new proof of decidability of higher-order subtyping in the presence of bounded quantification. The algorithm is formulated as a judgement which operates on b...