Meaningless terms in rewriting

Kennaway, Richard, van Oostrom, Vincent and de Vries, Fer-Jan (1996) Meaningless terms in rewriting. In: Algebraic and Logic Programming. Lecture Notes in Computer Science, 1139 . Springer Berlin / Heidelberg, pp. 254-268.

Full text not available from this repository. (Request a copy)

Abstract

We present an axiomatic approach to meaninglessness in finite and transfinite term rewriting and lambda calculus. We justify our axioms in two ways. First, they are shown to imply important properties of meaninglessness: genericity of the class of meaningless terms, the consistency of equating all meaningless terms, and the construction of Böhm trees. Second we show that they can be easily verified for existing notions of meaninglessness.

Item Type:	Book Section
Additional Information:	5th International Conference, ALP'96 Aachen, Germany, September 25–27, 1996 Proceedings
Faculty \ School:	Faculty of Science > School of Computing Sciences
Depositing User:	Vishal Gautam
Date Deposited:	04 Mar 2011 09:11
Last Modified:	24 Sep 2024 07:51
URI:	https://ueaeprints.uea.ac.uk/id/eprint/23340
DOI:	10.1007/3-540-61735-3_17

Actions (login required)

View Item