| Syntactic definitions of undefined: on defining the undefined (Extended Abstract) (1994) | |||||||||||||||
Abstract | |||||||||||||||
| Zena Ariola 1 , Richard Kennaway 2 , Jan Willem Klop 3 , Ronan Sleep 4 and Fer-Jan de Vries 5 1 Computer and Information Science Department, University of Oregon, Eugene, Oregon 2;4 School of Information Systems, University of East Anglia, Norwich NR4 7TJ, UK 3;5 CWI, P.O. Box 4079, 1009 AB Amsterdam, the Netherlands Contact addresses: 5 ferjan@cwi.nl and 2 jrk@sys.uea.ac.uk 2;4 fax: +44 603 50772, 3;5 fax: +31 20 5924199 Abstract In the -calculus, there is a standard notion of what terms should be considered to be "undefined": the unsolvable terms. There are various equivalent characterisations of this property of terms. We attempt to find a similar notion for orthogonal term rewrite systems. We find that in general the properties of terms analogous to the various characterisations of solvability differ. We give two axioms that a notion of undefinedness should satisfy, and explore some of their consequences. The axioms lead to a concept analogous to the Bohm trees o... | |||||||||||||||
Details der Publikation | |||||||||||||||
| |||||||||||||||