Semantic Labelling for Proving Termination of Combinatory Reduction Systems

Makoto Hamana. Semantic Labelling for Proving Termination of Combinatory Reduction Systems. In Santiago Escobar, editor, Functional and Constraint Logic Programming, 18th International Workshop, WFLP 2009, Brasilia, Brazil, June 28, 2009, Revised Selected Papers. Volume 5979 of Lecture Notes in Computer Science, pages 62-78, Springer, 2009. [doi]

@inproceedings{Hamana09-0,
  title = {Semantic Labelling for Proving Termination of Combinatory Reduction Systems},
  author = {Makoto Hamana},
  year = {2009},
  doi = {10.1007/978-3-642-11999-6_5},
  url = {http://dx.doi.org/10.1007/978-3-642-11999-6_5},
  tags = {termination},
  researchr = {https://researchr.org/publication/Hamana09-0},
  cites = {0},
  citedby = {0},
  pages = {62-78},
  booktitle = {Functional and Constraint Logic Programming, 18th International Workshop, WFLP 2009, Brasilia, Brazil, June 28, 2009, Revised Selected Papers},
  editor = {Santiago Escobar},
  volume = {5979},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-642-11998-9},
}