© University of Kent - Contact | Feedback | Legal | FOI | Cookies
Towards a domain theory for termination proofs
Stefan Kahrs
In Jieh Hsiang, editor, Rewriting Techniques and Applications, volume 914 of Lecture Notes in Computer Science, pages 182-196. Springer, April 1995.Abstract
We present a general framework for termination proofs for Higher-Order Rewrite Systems. The method is tailor-made for having simple proofs showing the termination of enriched $\lambda$-calculi.
Download publication 74 kbytesBibtex Record
@conference{566, author = {Stefan Kahrs}, title = {Towards a domain theory for termination proofs}, month = {April}, year = {1995}, pages = {182-196}, keywords = {determinacy analysis, Craig interpolants}, note = {}, doi = {}, url = {http://www.cs.kent.ac.uk/pubs/1995/566}, ISBN = {3-540-59200-8}, booktitle = {Rewriting Techniques and Applications}, editor = {Jieh Hsiang}, publisher = {Springer}, refereed = {yes}, series = {Lecture Notes in Computer Science}, volume = {914}, }