Sciweavers

37 search results - page 1 / 8
» Subtyping Constraints in Quasi-lattices
Sort
View
ASIAN
1999
Springer
114views Algorithms» more  ASIAN 1999»
13 years 9 months ago
Entailment of Non-structural Subtype Constraints
Entailment of subtype constraints was introduced for constraint simplification in subtype inference systems. Designing an efficient algorithm for subtype entailment turned out to...
Joachim Niehren, Tim Priesnitz
POPL
2002
ACM
14 years 5 months ago
The first-order theory of subtyping constraints
We investigate the first-order theory of subtyping constraints. We show that the first-order theory of nonstructural subtyping is undecidable, and we show that in the case where a...
Zhendong Su, Alexander Aiken, Joachim Niehren, Tim...
ICALP
1998
Springer
13 years 9 months ago
Constraint Automata and the Complexity of Recursive Subtype Entailment
Abstract. We study entailment of structural and nonstructural recursive subtyping constraints. Constraints are formal inequalities between type expressions, interpreted over an ord...
Fritz Henglein, Jakob Rehof
ECOOP
2006
Springer
13 years 8 months ago
Variance and Generalized Constraints for C# Generics
Abstract. Generic types in C behave invariantly with respect to subtyping. We propose a system of type-safe variance for C that supports the declaration of covariant and contravari...
Burak Emir, Andrew Kennedy, Claudio V. Russo, Dach...
APSEC
2005
IEEE
13 years 10 months ago
Call-Ordering Constraints
Several kinds of call-ordering problems have been identified, all of which present subtle difficulties in ensuring the correctness of a sequential program. They include object pro...
Nam Tran, David Abramson, Christine Mingins