Abstract
λProlog is a logic programming language in which hereditary Harrop formulas generalize Horn formulas, and simply typed λ-terms generalize Prolog terms. One may wonder if these extensions are simultaneously required, and if useful subsets of λPrologcan be defined, at least for pedagogical purposes. We answer this question by exhibiting a network of necessity links between the new features of λProlog. The starting point of the network is the demand for programming by structural induction on λ-terms, and the necessity links give a rationale for such a programming style.
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.
