Semantic labelling for proving termination of combinatory reduction systems

@inproceedings{Hamana2009SemanticLF,
  title={Semantic labelling for proving termination of combinatory reduction systems},
  author={Makoto Hamana},
  booktitle={WFLP},
  year={2009}
}
We give a novel transformation method for proving termination of higher-order rewrite rules in Klop’s format called Combinatory Reduction System (CRS). The format CRS essentially covers the usual pure higher-order functional programs such as Haskell. Our method called higher-order semantic labelling is an extension of a method known in the theory of term rewriting. This attaches semantics of the arguments to each function symbol. We systematically define the labelling by using the complete… CONTINUE READING

Citations

Publications citing this paper.
Showing 1-2 of 2 extracted citations

Functional and Logic Programming

Lecture Notes in Computer Science • 2018
View 4 Excerpts
Highly Influenced

From nominal to higher-order rewriting and back again

Logical Methods in Computer Science • 2015
View 1 Excerpt

References

Publications referenced by this paper.
Showing 1-10 of 20 references

Hamana . Universal algebra for termination of higher - order rewriting

M.
2005

Free Σmonoids : A higher - order syntax with metavariables

M.
Asian Symposium on Programming Languages and Systems ( APLAS • 2004

Playing by the rules : rewriting as a practical optimisation technique in GHC

J. W. Klop
Haskell Workshop • 2001

Similar Papers

Loading similar papers…