Feasibility of a set-theoretic data structure. A general structure based on a reconstituted definition of relation

D. L. Childs. Feasibility of a set-theoretic data structure. A general structure based on a reconstituted definition of relation. In IFIP Congress (2). pages 420-430, 1968.

@inproceedings{Childs68,
  title = {Feasibility of a set-theoretic data structure. A general structure based on a reconstituted definition of relation},
  author = {D. L. Childs},
  year = {1968},
  tags = {rule-based},
  researchr = {https://researchr.org/publication/Childs68},
  cites = {0},
  citedby = {0},
  pages = {420-430},
  booktitle = {IFIP Congress (2)},
}