Abstract
There is sometimes the requirement in logic programming applications to collect all the solutions of a non-deterministic program and associated goal. A manual technique is given for translating an example Prolog procedure, append/3, used by the predicate bagof/3, to a functionally equivalent program expressed in the functional programming language Miranda which uses a ZF (Zermelo Frankel) expression.
Sign-in/Register to access full text options 
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.
