Pure, Declarative, and Constructive Arithmetic Relations (Declarative Pearl)

DOI10.1007/978-3-540-78969-7_7MaRDI QIDQ5458428zbMATH OpenOpenAlexFDO

Authors Oleg Kiselyov, William Byrd, Daniel P. Friedman, Chung-Chieh Shan

Publication date 11 April 2008

Published in Functional and Logic Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-78969-7_7

Mathematics Subject Classification ID

Logic programming (68N17)

Recommendations

• A declarative approach for first-order built-in's of Prolog
• A closer look at declarative interpretations
• Reasoning about termination of pure Prolog programs
• Declaring numbers
• Unifying theories for logic programming

Cited in

(3)

• Binary trees as a computational framework
• Declaring numbers
• Tableless calculation of circular functions on dyadic rationals

Describes a project that uses

Uses Software

• miniKanren
• KANREN

This page was built for publication: Pure, Declarative, and Constructive Arithmetic Relations (Declarative Pearl)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5458428)