The Prolog debugger and declarative programming
From MaRDI portal
Abstract: Logic programming is a declarative programming paradigm. Programming language Prolog makes logic programming possible, at least to a substantial extent. However the Prolog debugger works solely in terms of the operational semantics. So it is incompatible with declarative programming. This report discusses this issue and tries to find how the debugger may be used from the declarative point of view. The results are rather not encouraging. Also, the box model of Byrd, used by the debugger, is explained in terms of SLD-resolution.
Recommendations
Cites work
- scientific article; zbMATH DE number 3947593 (Why is no real title available?)
- scientific article; zbMATH DE number 3967882 (Why is no real title available?)
- scientific article; zbMATH DE number 1971503 (Why is no real title available?)
- scientific article; zbMATH DE number 788036 (Why is no real title available?)
- Algorithm = logic + control
- Correctness and completeness of logic programs
- Inductive assertion method for logic pograms
- Logic + control: on program construction and verification
- Proving completeness of logic programs with the cut
Cited in
(5)- scientific article; zbMATH DE number 517022 (Why is no real title available?)
- Tracing Prolog programs by source instrumentation is efficient enough
- scientific article; zbMATH DE number 7453099 (Why is no real title available?)
- On GCLA, Gisela, and MedView. Studies in declarative programming with application to clinical medicine
- scientific article; zbMATH DE number 5706177 (Why is no real title available?)
This page was built for publication: The Prolog debugger and declarative programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5097636)