Some complexity bounds for subtype inequalities

DOI10.1016/S0304-3975(98)00134-0zbMath0913.68080MaRDI QIDQ1275620

Marcin Benke

Publication date: 12 January 1999

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

complexitysubtypingtype reconstruction

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (2)

Retractions onto series-parallel posets ⋮ Satisfying subtype inequalities in polynomial space

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An application of the Helly property to the partially ordered sets
• On the Helly property working as a compactness criterion on graphs
• Holes in ordered sets
• A structure theory for ordered sets
• Cores and retracts
• Fixed points and products
• Retractability and the fixed point property for products
• Crowns, Fences, and Dismantlable Lattices
• On the sequential nature of unification
• Retracts and the Fixed Point Problem for Finite Partially Ordered Sets
• Type inference with simple subtypes
• Type reconstruction with recursive types and atomic subtyping

This page was built for publication: Some complexity bounds for subtype inequalities