Abstract
The set of head recurrent terms of Weak Combinatory Logic is defined as a set including that of terms in head normal form. More over, a subset of the set of head recurrent terms is that of recurrent ones, i.e. the set of terms T such that every reductum of T reduces to T. A normal reduction strategy which reveals head recurrence and recurrence is described.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
