A declarative approach for first-order built-in's of Prolog
From MaRDI portal
Publication:1328181
Recommendations
Cites work
- scientific article; zbMATH DE number 1638665 (Why is no real title available?)
- scientific article; zbMATH DE number 3978351 (Why is no real title available?)
- scientific article; zbMATH DE number 25189 (Why is no real title available?)
- scientific article; zbMATH DE number 43398 (Why is no real title available?)
- scientific article; zbMATH DE number 65740 (Why is no real title available?)
- scientific article; zbMATH DE number 1142320 (Why is no real title available?)
- A declarative approach for first-order built-in's of Prolog
- A new definition of SLDNF-resolution
- Declarative modeling of the operational behavior of logic languages
- Reasoning about termination of pure Prolog programs
- The Semantics of Predicate Logic as a Programming Language
Cited in
(5)- A declarative approach for first-order built-in's of Prolog
- Termination of floating-point computations
- Pure, Declarative, and Constructive Arithmetic Relations (Declarative Pearl)
- On proving confluence modulo equivalence for Constraint Handling Rules
- The BinProlog experience: architecture and implementation choices for continuation passing Prolog and first-class logic engines
This page was built for publication: A declarative approach for first-order built-in's of Prolog
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1328181)