Towards Assertion-based Debugging of Higher-Order (C)LP Programs
Nataliia Stulova, Jos\'e F. Morales, Manuel V. Hermenegildo

TL;DR
This paper extends assertion-based debugging techniques to higher-order (C)LP programs, enabling better error detection and validation for more expressive logic programming constructs.
Contribution
It introduces an extension of properties and assertions to handle predicate arguments, integrating assertion-based debugging with higher-order (C)LP.
Findings
Enhanced error detection in higher-order (C)LP programs
Successful integration of assertions with higher-order constructs
Improved program validation capabilities
Abstract
Higher-order constructs extend the expressiveness of first-order (Constraint) Logic Programming ((C)LP) both syntactically and semantically. At the same time assertions have been in use for some time in (C)LP systems helping programmers detect errors and validate programs. However, these assertion-based extensions to (C)LP have not been integrated well with higher order to date. Our work contributes to filling this gap by extending the assertion-based approach to error detection and program validation to the higher-order context, within (C)LP. It is based on an extension of properties and assertions as used in (C)LP in order to be able to fully describe arguments that are predicates.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsParallel Computing and Optimization Techniques · Embedded Systems Design Techniques · Logic, programming, and type systems
