Pure, Declarative, and Constructive Arithmetic Relations .
Oleg Kiselyov, William E. Byrd, Daniel P. Friedman, and Chung-chieh Shan. FLOPS 2008. (source code)
We present decidable logic programs for addition, multiplication, division with remainder, exponentiation, and logarithm with remainder over the unbounded domain of natural numbers.
Our predicates represent relations without mode restrictions or annotations. They are fully decidable under the common, DFS-like, SLD resolution strategy of Prolog or under an interleaving refinement of DFS...
[The] attempts to define...
Beyond pure Prolog: Power and danger
One of the sections of Oleg Kiselyov's Prolog and Logic Programming page, on Beyond pure Prolog: power and danger, points out (i) term introspection (in the guise of the var/1 predicate) can...
Semi-implicit batched remote code execution as staging
Oleg Kiselyov has just posted another amazing work: Semi-implicit batched remote code execution as staging. Batching several remote-procedure or remote-object operations into one request...
Functional Pearl: Implicit Configurations —or,...
Functional Pearl: Implicit Configurations —or, Type Classes Reflect the Values of Types, by Oleg Kiselyov and Chung-chieh Shan: The configurations problem is to propagate run-time...
Post new comment