Syntactic definitions of undefined: On defining the undefined

DOI10.1007/3-540-57887-0_114MaRDI QIDQ4490748zbMATH OpenFDO

Authors Zena M. Ariola, Richard Kennaway, Jan Willem Klop, Ronan Sleep, Fer-Jan De Vries

Publication date 20 July 2000

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://ir.cwi.nl/pub/26550

zbMATH Keywords

Böhm treeslambda-calculusorthogonal term rewriting systemssolvabilityundefined terms

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40) Grammars and rewriting systems (68Q42)

Recommendations

• Meaningless terms in rewriting
• scientific article; zbMATH DE number 1332646
• scientific article; zbMATH DE number 6792351
• Theoretical Pearls:Representing ‘undefined’ in lambda calculus
• Rewriting Techniques and Applications

Cited in

(9)

• Normalization results for typeable rewrite systems
• Lambda calculus with explicit recursion
• Highlights in infinitary rewriting and lambda calculus
• Meaningless terms in rewriting
• scientific article; zbMATH DE number 1332646 (Why is no real title available?)
• Approximation and normalization results for typeable term rewriting systems
• Infinitary lambda calculi and böhm models
• Lambda-definable term rewriting systems
• Should computations halt?

This page was built for publication: Syntactic definitions of undefined: On defining the undefined

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4490748)