Meaningless terms in rewriting

Richard Kennaway, Vincent van Oostrom, Fer-Jan de Vries

Research output: Chapter in Book/Report/Conference proceedingChapter

4 Citations (Scopus)


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.
Original languageEnglish
Title of host publicationAlgebraic and Logic Programming
EditorsMichael Hanus, Mario Rodríguez-Artalejo
PublisherSpringer Berlin / Heidelberg
Number of pages15
Publication statusPublished - 1996

Publication series

NameLecture Notes in Computer Science
PublisherSpringer Berlin / Heidelberg

Cite this