A Completeness Theorem for Recursively Defined Types

Mario Coppo. A Completeness Theorem for Recursively Defined Types. In Wilfried Brauer, editor, Automata, Languages and Programming, 12th Colloquium, Nafplion, Greece, July 15-19, 1985, Proceedings. Volume 194 of Lecture Notes in Computer Science, pages 120-129, Springer, 1985.

@inproceedings{Coppo85,
  title = {A Completeness Theorem for Recursively Defined Types},
  author = {Mario Coppo},
  year = {1985},
  tags = {completeness},
  researchr = {https://researchr.org/publication/Coppo85},
  cites = {0},
  citedby = {0},
  pages = {120-129},
  booktitle = {Automata, Languages and Programming, 12th Colloquium, Nafplion, Greece, July 15-19, 1985, Proceedings},
  editor = {Wilfried Brauer},
  volume = {194},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-15650-X},
}