Three Syntactic Theories for Combinatory Graph Reduction

Olivier Danvy, Ian Zerny. Three Syntactic Theories for Combinatory Graph Reduction. In María Alpuente, editor, Logic-Based Program Synthesis and Transformation - 20th International Symposium, LOPSTR 2010, Hagenberg, Austria, July 23-25, 2010, Revised Selected Papers. Volume 6564 of Lecture Notes in Computer Science, pages 1-20, Springer, 2010. [doi]

@inproceedings{DanvyZ10,
  title = {Three Syntactic Theories for Combinatory Graph Reduction},
  author = {Olivier Danvy and Ian Zerny},
  year = {2010},
  doi = {10.1007/978-3-642-20551-4_1},
  url = {http://dx.doi.org/10.1007/978-3-642-20551-4_1},
  tags = {graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/DanvyZ10},
  cites = {0},
  citedby = {0},
  pages = {1-20},
  booktitle = {Logic-Based Program Synthesis and Transformation - 20th International Symposium, LOPSTR 2010, Hagenberg, Austria, July 23-25, 2010, Revised Selected Papers},
  editor = {María Alpuente},
  volume = {6564},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-642-20550-7},
}