Prolog

Русское название:

Пролог

Дата создания:

1972

Повлиял на:

• Erlang
• Mercury
• Oz
• Picat

Парадигма:

• вычисления с откатами
• декларативная
• логическая
• рефлексивная

Типизация:

• динамическая
• неявная
• строгая

Принятые расширения файлов:

.pl, .pro

Диалекты:

• Edinburgh Prolog
• ISO Prolog
• Strawberry Prolog

Реализации и версии (свернуть все | развернуть все):

• Arity Prolog
• Arity/Prolog32
• B-Prolog
  • B-Prolog 1.0
  • B-Prolog 1.2
  • B-Prolog 1.5
  • B-Prolog 1.6
  • B-Prolog 2.0
  • B-Prolog 2.1
  • B-Prolog 3.0
  • B-Prolog 3.1
  • B-Prolog 3.2
  • B-Prolog 4.0
  • B-Prolog 5.0
  • B-Prolog 5.0-a
  • B-Prolog 5.0-b
  • B-Prolog 6.0
  • B-Prolog 6.0 beta
  • B-Prolog 6.1
  • B-Prolog 6.2
  • B-Prolog 6.4
  • B-Prolog 6.5
  • B-Prolog 6.6
  • B-Prolog 6.7
  • B-Prolog 6.7-1
  • B-Prolog 6.7-3
  • B-Prolog 6.8
  • B-Prolog 6.9
  • B-Prolog 7.0
  • B-Prolog 7.1beta4
  • B-Prolog 7.4-3
  • B-Prolog 8.0
• BinProlog
• Brain Aid Prolog
• Ciao Prolog
• CxProlog
• ECLiPSe CLP
  • ECLiPSe CLP 6.0 #188
• EZY Prolog
  • EZY Prolog 1.0
  • EZY Prolog 1.01
  • EZY Prolog 2.0
  • EZY Prolog 2.1
  • EZY Prolog 3.0
  • EZY Prolog 4.0
  • EZY Prolog SUITE
  • EZY Prolog WYSIWYG
• GNU Prolog
  • gprolog 1.3.0
  • gprolog 1.3.1
• IF/Prolog
• JIProlog
• K-Prolog
• MINERVA
• Open Prolog
• PDC/Turbo Prolog
  • PDC Prolog 3.31
  • Turbo Prolog 1.0
  • Turbo Prolog 2.0
• Poplog (Prolog)
  • Poplog 15.5 (Prolog)
• Qu-Prolog
• SICStus Prolog
• SWI-Prolog
  • swipl 5.6.x
• Trinc-Prolog
  • R3B
• Visual Prolog
  • Visual Prolog 4.0
  • Visual Prolog 5.0
  • Visual Prolog 5.1
  • Visual Prolog 7.2
• YAP

implement main
    open core

constants
    className = "main".
    classVersion = "".

clauses
    classInfo(className, classVersion).

clauses
    run():-
        console::init(),
        stdio::write("Hello, World!"),
        programControl::sleep(1000),
        succeed().
end implement main

goal
    mainExe::run(main::run).

% main.cl
class main
    open core

predicates
    classInfo : core::classInfo.
    factorial : (integer N, integer F) procedure (i,o).
predicates
    run : core::runnable.

end class main

% main.pro
implement main
    open core

constants
    className = "main".
    classVersion = "".

clauses
    classInfo(className, classVersion).
    factorial(0,F) :- 
        !,
        F = 1, 
        stdio::write("0! = 1"),
        stdio::nl.
    factorial(N,F) :-
        factorial(N-1,F1),
        F = N*F1,
        stdio::write(N, "! = ", F),
        stdio::nl.
        
clauses
    run():-
        console::init(),
        factorial(12,F),
        programControl::sleep(1000),
        succeed().
end implement main

goal
    mainExe::run(main::run).

% main.cl
class main
    open core

predicates
    classInfo : core::classInfo.
    fibonacci : (integer N, integer F) procedure (i,o).
    loop : (integer N) procedure (i).
predicates
    run : core::runnable.

end class main

% main.pro
implement main
    open core

constants
    className = "main".
    classVersion = "".

clauses
    classInfo(className, classVersion).
    fibonacci(N,F) :- 
        N < 3, !, F = 1;
        fibonacci(N-1,F1), fibonacci(N-2,F2), F = F1 + F2.
    loop(N) :-
        ( N = 1, !, fibonacci(1,F);
          loop(N-1), fibonacci(N,F) ),
        stdio::write(F, ", ").        
clauses
    run():-
        console::init(),
        loop(16),
        stdio::write("..."),
        programControl::sleep(1000),
        succeed().
end implement main

goal
    mainExe::run(main::run).

write('Hello, World!'), nl.

% fibonacci.pl
:- dynamic(stored/1).

memo(Goal) :-
    stored(Goal) -> true;
    Goal, assertz(stored(Goal)).

fib(1,1) :- !, write('1, ').
fib(2,1) :- !, write('1, ').
fib(N,F) :-
    N1 is N-1, memo(fib(N1,F1)), 
    N2 is N-2, memo(fib(N2,F2)), 
    F is F1 + F2,
    write(F), write(', ').

% interactive
[-fibonacci].
fib(16,X), write('...'), nl.

% fact.pl
fact(X, F) :- 
    ( X=0, F=1; 
      Y is X-1, fact(Y, Z), F is X*Z), 
    write(X), write('! = '), write(F), nl.

% interactive
[-fact].
fact(16,X).

% main.cl
class main
    open core

predicates
    classInfo : core::classInfo.
    q : () procedure().
predicates
    run : core::runnable.

end class main

% main.pro
implement main
    open core

constants
    className = "main".
    classVersion = "".

clauses
    classInfo(className, classVersion).
    q() :-
        stdio::write("A = "), 
        A = stdio::read(),
        if (A = 0), ! then
            stdio::write("Not a quadratic equation."), stdio::nl
        else
            stdio::write("B = "), 
            B = stdio::read(),
            stdio::write("C = "), 
            C = stdio::read(),
            if (B*B = 4*A*C), ! then
                stdio::writef("x = %f", -B/2.0/A)
            elseif (B*B > 4*A*C), ! then
                D = B*B-4*A*C,
                stdio::writef("x1 = %f\n", (-B+math::sqrt(D))/2.0/A),
                stdio::writef("x2 = %f", (-B-math::sqrt(D))/2.0/A)
            else
                D = -B*B+4*A*C,
                stdio::writef("x1 = (%f, %f)\n", -B/2.0/A, math::sqrt(D)/2.0/A),
                stdio::writef("x2 = (%f, %f)", -B/2.0/A, -math::sqrt(D)/2.0/A)
            end if
        end if.
        
clauses
    run():-
        console::init(),
        q(),
        succeed().
end implement main

goal
    mainExe::run(main::run).

% fact.pl
fact(X, F) :- 
    ( X=0, F=1; 
      Y is X-1, fact(Y, Z), F is X*Z), 
    write(X), write('! = '), write(F), nl.

% interactive
[fact].
fact(16,X).

% fibonacci.pl
:- dynamic(stored/1).

memo(Goal) :-
    stored(Goal) -> true;
    Goal, assertz(stored(Goal)).

fib(1,1) :- !, write('1, ').
fib(2,1) :- !, write('1, ').
fib(N,F) :-
    N1 is N-1, memo(fib(N1,F1)), 
    N2 is N-2, memo(fib(N2,F2)), 
    F is F1 + F2,
    write(F), write(', ').

% interactive
[fibonacci].
fib(16,X), write('...'), nl.

q :- write('A = '),
     read_integer(A),
     (   A = 0, write('Not a quadratic equation');
         write('B = '),
         read_integer(B),
         write('C = '),
         read_integer(C),
         D is B*B-4*A*C,
         (   D = 0, write('x = '), X is -B/2/A, write(X);
             D > 0, write('x1 = '), X1 is (-B+sqrt(D))/2/A, write(X1), nl, write('x2 = '), X2 is (-B-sqrt(D))/2/A, write(X2);
             R is -B/2/A, I is abs(sqrt(-D)/2/A), 
             write('x1 = ('), write(R), write(', '), write(I), write(')'), nl,
             write('x1 = ('), write(R), write(', -'), write(I), write(')')
         )
     ).

q :- write('A = '),
     read(A),
     (   A = 0, write('Not a quadratic equation');
         write('B = '),
         read(B),
         write('C = '),
         read(C),
         D is B*B-4*A*C,
         (   D = 0, write('x = '), X is -B/2/A, write(X);
             D > 0, write('x1 = '), X1 is (-B+sqrt(D))/2/A, write(X1), nl, write('x2 = '), X2 is (-B-sqrt(D))/2/A, write(X2);
             R is -B/2/A, I is abs(sqrt(-D)/2/A), 
             write('x1 = ('), write(R), write(', '), write(I), write(')'), nl,
             write('x1 = ('), write(R), write(', -'), write(I), write(')')
         )
     ).

factorial(0, 1) :- 
    !.
factorial(N, F) :-
    N > 0,
    N1 is N - 1,
    factorial(N1, F1),
    F is N * F1.

main :-
    ( for(N, 0, 16) do
        factorial(N, F),
        write(N), write('! = '), write(F), nl ).

fibonacci(1, 1) :- !.
fibonacci(2, 1) :- !.
fibonacci(N, F) :-
    N > 2,
    N1 is N - 1, N2 is N - 2,
    fibonacci(N1, F1), fibonacci(N2, F2),
    F is F1 + F2.

main :-
    ( for(N, 1, 16) do
        fibonacci(N, F),
        write(F), write(', ') ),
    writeln('...').

:- local store(fibonacci).

fibonacci(1, 1) :- !.
fibonacci(2, 1) :- !.
fibonacci(N, F) :-
    N > 2,
    ( 
        % используем сохраненный результат
        store_get(fibonacci, N, F), !
    ;
        N1 is N - 1, N2 is N - 2,
        fibonacci(N1, F1), fibonacci(N2, F2),
        F is F1 + F2,
        store_set(fibonacci, N, F) % сохраняем полученный результат
    ).

main :-
    ( for(N, 1, 16) do
        fibonacci(N, F),
        write(F), write(', ') ),
    writeln('...').

Комментарии

blog comments powered by Disqus