Non-structural subtype entailment in automata theory

DOI10.1016/S0890-5401(03)00140-8zbMath1078.68092MaRDI QIDQ1887157

Tim Priesnitz, Joachim Niehren

Publication date: 23 November 2004

Published in: Information and Computation (Search for Journal in Brave)

zbMATH Keywords

Finite automataWord equationsProgramming languagesSubtyping

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Theory of programming languages (68N15)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Type inference with subtypes
• Efficient inference of partial types
• Type inference with non-structural subtyping
• Unification in the union of disjoint equational theories: Combining decision procedures
• Undecidability of the positive \(\forall\exists^ 3\)-theory of a free semigroup
• Simplifying subtyping constraints
• DECIDABILITY OF THE POSITIVE THEORY OF A FREE COUNTABLY GENERATED SEMIGROUP
• Efficient recursive subtyping
• Type inference with simple subtypes
• The first-order theory of subtyping constraints
• A framework for type inference with subtyping
• Makanin's algorithm for word equations-two improvements and a generalization

This page was built for publication: Non-structural subtype entailment in automata theory