Sciweavers

2373 search results - page 3 / 475
» On the Theory of Structural Subtyping
Sort
View
TACS
2001
Springer
13 years 10 months ago
Non-structural Subtype Entailment in Automata Theory
Decidability of non-structural subtype entailment is a long standing open problem in programming language theory. In this paper, we apply automata theoretic methods to characterize...
Joachim Niehren, Tim Priesnitz
ECOOP
2008
Springer
13 years 8 months ago
Integrating Nominal and Structural Subtyping
Nominal and structural subtyping each have their own strengths and weaknesses. Nominal subtyping allows programmers to explicitly express design intent, and, when types are associa...
Donna Malayeri, Jonathan Aldrich
ASIAN
1999
Springer
114views Algorithms» more  ASIAN 1999»
13 years 10 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
2010
ACM
14 years 3 months ago
Pure Subtype Systems
This paper introduces a new approach to type theory called pure subtype systems. Pure subtype systems differ from traditional approaches to type theory (such as pure type systems)...
DeLesley S. Hutchins
ICALP
1998
Springer
13 years 10 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