17 search results - page 1 / 4 » Executable Set Theory and Arithmetic Encodings in Prolog |
CORR
2008
Springer
13 years 4 months ago
2008
Springer
The paper is organized as a self-contained literate Prolog program that implements elements of an executable finite set theory with focus on combinatorial generation and arithmetic...
CORR
2008
Springer
13 years 4 months ago
2008
Springer
The paper is organized as a self-contained literate Haskell program that implements elements of an executable finite set theory with focus on combinatorial generation and arithmet...
CORR
2008
Springer
13 years 4 months ago
2008
Springer
Prolog's ability to return multiple answers on backtracking provides an elegant mechanism to derive reversible encodings of combinatorial objects as Natural Numbers i.e. ranki...
CORR
2008
Springer
13 years 3 months ago
2008
Springer
In deduction modulo, a theory is not represented by a set of axioms but by a congruence on propositions modulo which the inference rules of standard deductive systems--such as for ...
INTEGRATION
2008
13 years 4 months ago
2008
Abstract: Hybrid-redundant number representation has provided a flexible framework for digitparallel addition in a manner that facilitates area-time tradeoffs for VLSI implementati...