Some Complexity Bounds for Subtype Inequalities

Marcin Benke. Some Complexity Bounds for Subtype Inequalities. Theoretical Computer Science, 212(1-2):3-27, 1999. [doi]

@article{Benke99:0,
  title = {Some Complexity Bounds for Subtype Inequalities},
  author = {Marcin Benke},
  year = {1999},
  doi = {10.1016/S0304-3975(98)00134-0},
  url = {http://dx.doi.org/10.1016/S0304-3975(98)00134-0},
  tags = {subtyping},
  researchr = {https://researchr.org/publication/Benke99%3A0},
  cites = {0},
  citedby = {0},
  journal = {Theoretical Computer Science},
  volume = {212},
  number = {1-2},
  pages = {3-27},
}