File: fib.chr

package info (click to toggle)
swi-prolog 9.0.4%2Bdfsg-2
  • links: PTS, VCS
  • area: main
  • in suites: bookworm
  • size: 82,408 kB
  • sloc: ansic: 387,503; perl: 359,326; cpp: 6,613; lisp: 6,247; java: 5,540; sh: 3,147; javascript: 2,668; python: 1,900; ruby: 1,594; yacc: 845; makefile: 428; xml: 317; sed: 12; sql: 6
file content (34 lines) | stat: -rw-r--r-- 656 bytes parent folder | download | duplicates (7)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%%
%% 991202 Slim Abdennadher, LMU
%%
%% ported to hProlog by Tom Schrijvers

:- module(fib,[main/0,main/1]).

:- use_module(library(chr)).

:- chr_constraint fib/2.

%% fib(N,M) is true if  M is the Nth Fibonacci number.

%% Top-down Evaluation with Tabulation

fib(N,M1), fib(N,M2) <=> M1 = M2, fib(N,M1).

fib(0,M) ==> M = 1.

fib(1,M) ==> M = 1.

fib(N,M) ==> N > 1 | N1 is N-1, fib(N1,M1), N2 is N-2, fib(N2,M2), M is M1 + M2.

main :-
	main(22).

main(N):-
	cputime(X),
	fib(N,_),
	cputime( Now),
	Time is Now-X,
	write(bench(fib ,N,Time, 0, hprolog)),write('.'), nl.