rubylog 0.0.0

data/spec/inriasuite/integer

@@ -0,0 +1,10 @@
+/* file integer */
+
+[integer(3), success].
+[integer(-3), success].
+[integer(3.3), failure].
+[integer(X), failure].
+[integer(atom), failure].
+
+/* end of integer */
+

data/spec/inriasuite/is

@@ -0,0 +1,11 @@
+/* file is */
+
+['is'(Result,3 + 11.0),[[Result <-- 14.0]]].
+[(X = 1 + 2, 'is'(Y, X * 3)),[[X <-- (1 + 2), Y <-- 9]]]. % error? 1+2
+['is'(foo,77), failure]. % error? foo
+['is'(77, N), instantiation_error].
+['is'(77, foo), type_error(evaluable, foo/0)].
+
+['is'(X,float(3)),[[X <-- 3.0]]].
+
+/* end of is */

data/spec/inriasuite/nonvar

@@ -0,0 +1,11 @@
+/* file nonvar */
+
+[nonvar(33.3), success].
+[nonvar(foo), success].
+[nonvar(Foo), failure].
+[(foo=Foo,nonvar(Foo)),[[Foo <-- foo]]].
+[nonvar(_), failure].
+[nonvar(a(b)), success].
+
+/* end of nonvar */
+

data/spec/inriasuite/not_provable

@@ -0,0 +1,12 @@
+/* file \+ */
+
+[\+(true), failure].
+[\+(!), failure].
+[\+((!,fail)), success].
+[((X=1;X=2), \+((!,fail))), [[X <-- 1],[X <-- 2]]].
+[\+(4 = 5), success].
+[\+(3), type_error(callable, 3)].
+[\+(X), instantiation_error]. % Culprit X
+
+/* end of \+ */
+

data/spec/inriasuite/not_unify

@@ -0,0 +1,15 @@
+/* file \= */
+
+['\\='(1,1), failure].
+['\\='(X,1), failure].
+['\\='(X,Y), failure].
+[('\\='(X,Y),'\\='(X,abc)), failure].
+['\\='(f(X,def),f(def,Y)), failure].
+['\\='(1,2), success].
+['\\='(1,1.0), success].
+['\\='(g(X),f(f(X))), success].
+['\\='(f(X,1),f(a(X))), success].
+['\\='(f(X,Y,X),f(a(X),a(Y),Y,2)), success].
+
+/* end of \= */
+

data/spec/inriasuite/number

@@ -0,0 +1,10 @@
+/* file number */
+
+[number(3), success].
+[number(3.3), success].
+[number(-3), success].
+[number(a), failure].
+[number(X), failure].
+
+/* end of number */
+

data/spec/inriasuite/number_chars

@@ -0,0 +1,22 @@
+/* file number_chars */
+/* Some goals fails because the parser is not yet implemented */
+
+[number_chars(33,L), [[L <-- ['3','3']]]].
+[number_chars(33,['3','3']), success].
+[number_chars(33.0,L), [[L <-- ['3','3','.','0']]]].
+[number_chars(X,['3','.','3','E','+','0']), [[X <-- 3.3]]].
+[number_chars(3.3,['3','.','3','E','+','0']), success].
+[number_chars(A,['-','2','5']), [[A <-- (-25)]]].
+[number_chars(A,['\n',' ','3']), [[A <-- 3]]]. 
+[number_chars(A,['3',' ']), syntax_error(_)].
+[number_chars(A,['0',x,f]), [[A <-- 15]]].
+[number_chars(A,['0','''','A']), [[A <-- 65]]].
+[number_chars(A,['4','.','2']), [[A <-- 4.2]]].
+[number_chars(A,['4','2','.','0','e','-','1']), [[A <-- 4.2]]].
+
+[number_chars(A,L), instantiation_error].
+[number_chars(a,L), type_error(number, a)].
+[number_chars(A,4), type_error(list, 4)].
+[number_chars(A,['4',2]), type_error(character, 2)].
+
+/* end of file number_chars */

data/spec/inriasuite/number_codes

@@ -0,0 +1,19 @@
+/* file number_codes */
+/* Some goals fails because the parser is not yet implemented */
+
+[number_codes(33,L), [[L <-- [0'3,0'3]]]].
+[number_codes(33,[0'3,0'3]), success].
+[number_codes(33.0,L), [[L <-- [51,51,46,48]]]].
+[number_codes(33.0,[0'3,0'.,0'3,0'E,0'+,0'0,0'1]), success].
+[number_codes(A,[0'-,0'2,0'5]), [[A <-- (-25)]]].
+[number_codes(A,[0' ,0'3]), [[A <-- 3]]].
+[number_codes(A,[0'0,0'x,0'f]), [[A <-- 15]]].
+[number_codes(A,[0'0,39,0'a]), [[A <-- 97]]].
+[number_codes(A,[0'4,0'.,0'2]), [[A <-- 4.2]]].
+[number_codes(A,[0'4,0'2,0'.,0'0,0'e,0'-,0'1]), [[A <-- 4.2]]].
+
+[number_codes(A,L), instantiation_error].
+[number_codes(a,L), type_error(number,a)].
+[number_codes(A,4), type_error(list,4)].
+[number_codes(A,[ 0'1, 0'2, 1000]), representation_error(character_code)]. % 1000 not a code
+/* end of file number_codes */

data/spec/inriasuite/once

@@ -0,0 +1,11 @@
+/* file once */
+
+[once(!), success].
+[(once(!), (X=1; X=2)), [[X <-- 1],[X <-- 2]]].
+[once(repeat), success].
+[once(fail), failure].
+[once(3), type_error(callable, 3)].
+[once(X), instantiation_error]. % Culprit X
+
+/* end of once */
+

data/spec/inriasuite/or

@@ -0,0 +1,9 @@
+/* file ';' (or = disjunction) */
+
+[';'(true, fail), success].
+[';'((!, fail), true), failure].
+[';'(!, call(3)), success].
+[';'((X=1, !), X=2), [[X <-- 1]]].
+[';'(X=1, X=2), [[X <-- 1], [X <-- 2]]].
+
+/* end of file ';' (or = disjunction) */

data/spec/inriasuite/repeat

@@ -0,0 +1,5 @@
+/* file repeat */
+
+[(repeat,!,fail), failure].
+
+/* end of repeat */

data/spec/inriasuite/retract

@@ -0,0 +1,10 @@
+/* file retract */
+
+
+[retract((4 :- X)), type_error(callable, 4)]. 
+
+[retract((atom(_) :- X == '[]')), 
+	permission_error(modify,static_procedure,atom/1)].
+
+/* end of retract */
+

data/spec/inriasuite/set_prolog_flag

@@ -0,0 +1,21 @@
+/* file current_prolog_flag */
+
+[(set_prolog_flag(unknown, fail),
+  current_prolog_flag(unknown, V)), [[V <-- fail]]].
+[set_prolog_flag(X, warning), instantiation_error].
+[set_prolog_flag(5, decimals), type_error(atom,5)].
+[set_prolog_flag(date, 'July 1999'), domain_error(prolog_flag,date)].
+[set_prolog_flag(debug, no), domain_error(flag_value,debug+no)].
+[set_prolog_flag(max_arity, 40), permission_error(modify, flag, max_arity)].
+/* swindles to get tests of double quotes flag to work. */
+
+[set_prolog_flag(double_quotes, atom), success].
+[X = "fred", [[X <-- fred]]].
+
+[set_prolog_flag(double_quotes, codes), success].
+[X = "fred", [[X <-- [102,114,101,100]]]].
+
+[set_prolog_flag(double_quotes, chars), success].
+[X = "fred", [[X <-- [f,r,e,d]]]].
+
+/* end of current_prolog_flag */

data/spec/inriasuite/setof

@@ -0,0 +1,36 @@
+/* file of setof */
+
+[setof(X,(X=1;X=2),L), [[L <-- [1, 2]]]].
+
+[setof(X,(X=1;X=2),X), [[X <-- [1, 2]]]].
+
+[setof(X,(X=2;X=1),L), [[L <-- [1, 2]]]].
+
+[setof(X,(X=2;X=2),L), [[L <-- [2]]]].
+
+
+[setof(X,fail,L), failure].
+
+[setof(1,(Y=2;Y=1),L), [[L <-- [1], Y <-- 1], [L <-- [1], Y <-- 2]]].
+
+[setof(f(X,Y),(X=a;Y=b),L), [[L <-- [f(_, b), f(a, _)]]]].
+
+[setof(X,Y^((X=1,Y=1);(X=2,Y=2)),S), [[S <-- [1, 2]]]].
+
+[setof(X,Y^((X=1;Y=1);(X=2,Y=2)),S), [[S <-- [_, 1, 2]]]].
+
+[(set_prolog_flag(unknown, warning), 
+  setof(X,(Y^(X=1;Y=1);X=3),S)), [[S <-- [3]]]].
+[(set_prolog_flag(unknown, warning), 
+  setof(X,Y^(X=1;Y=1;X=3),S)), [[S <-- [_, 1,3]]]].
+
+[setof(X,(X=Y;X=Z;Y=1),L), [[L <-- [Y, Z]], [L <-- [_], Y <-- 1]]].
+
+
+
+
+[setof(X, X^(true; 4),L), type_error(callable,(true;4))].
+
+[setof(X,1,L), type_error(callable,1)].
+
+/* end of setof */

data/spec/inriasuite/sub_atom

@@ -0,0 +1,30 @@
+/* file sub_atom */
+
+[sub_atom(abracadabra, 0, 5, _, S2), [[S2 <-- 'abrac']]].
+[sub_atom(abracadabra, _, 5, 0, S2), [[S2 <-- 'dabra']]].
+[sub_atom(abracadabra, 3, Length, 3, S2), [[Length <-- 5, S2 <-- 'acada']]].
+[sub_atom(abracadabra, Before, 2, After, ab), 
+			[[Before <-- 0, After <-- 9],
+			 [Before <-- 7, After <-- 2]]].
+[sub_atom('Banana', 3, 2, _, S2), [[S2 <-- 'an']]].
+[sub_atom('charity', _, 3, _, S2), [[S2 <-- 'cha'],
+				    [S2 <-- 'har'],
+				    [S2 <-- 'ari'],
+				    [S2 <-- 'rit'],
+				    [S2 <-- 'ity']]].
+[sub_atom('ab', Before, Length, After, Sub_atom),
+	[[Before <-- 1, Length <-- 0, Sub_atom <-- ''],
+	 [Before <-- 1, Length <-- 1, Sub_atom <-- 'a'],
+	 [Before <-- 1, Length <-- 2, Sub_atom <-- 'ab'],
+	 [Before <-- 2, Length <-- 0, Sub_atom <-- ''],
+	 [Before <-- 2, Length <-- 1, Sub_atom <-- 'b'],
+	 [Before <-- 3, Length <-- 0, Sub_atom <-- '']]].
+
+[sub_atom(Banana, 3, 2, _, S2), instantiation_error].
+[sub_atom(f(a), 2, 2, _, S2), type_error(atom,f(a))].
+[sub_atom('Banana', 4, 2, _, 2), type_error(atom,2)].
+[sub_atom('Banana', a, 2, _, S2), type_error(integer,a)].
+[sub_atom('Banana', 4, n, _, S2), type_error(integer,n)].
+[sub_atom('Banana', 4, _, m, S2), type_error(integer,m)].
+
+/* end of sub_atom */

data/spec/inriasuite/t

@@ -0,0 +1 @@
+[bagof([X,Y], t_foo(X,Y), S) , t_foo, success].

data/spec/inriasuite/t_foo.pl

@@ -0,0 +1,4 @@
+t_foo(1,2).
+t_foo(2,3).
+t_foo(3,4).
+t_foo(_,_).

data/spec/inriasuite/term_diff

@@ -0,0 +1,13 @@
+/* file \== */
+
+['\\=='(1,1), failure].
+['\\=='(X,X), failure].
+['\\=='(1,2), success].
+['\\=='(X,1), success].
+['\\=='(X,Y), success].
+['\\=='(_,_), success].
+['\\=='(X,a(X)), success].
+['\\=='(f(a),f(a)), failure].
+
+/* end of \== */
+

data/spec/inriasuite/term_eq

@@ -0,0 +1,12 @@
+/* file == */
+
+['=='(1,1), success].
+['=='(X,X), success].
+['=='(1,2), failure].
+['=='(X,1), failure].
+['=='(X,Y), failure].
+['=='(_,_), failure].
+['=='(X,a(X)), failure].
+['=='(f(a),f(a)), success].
+
+/* end of == */

data/spec/inriasuite/term_gt

@@ -0,0 +1,12 @@
+/* file @> */
+
+['@>'(1.0,1), failure].
+['@>'(aardvark,zebra), failure].
+['@>'(short,short), failure].
+['@>'(short,shorter), failure].
+['@>'(foo(b),foo(a)), success].
+['@>'(X,X), failure].
+['@>'(foo(a,X),foo(b,Y)), failure].
+
+/* end of @> */
+

data/spec/inriasuite/term_gt=

@@ -0,0 +1,12 @@
+/* file @>= */
+
+['@>='(1.0,1), failure].
+['@>='(aardvark,zebra), failure].
+['@>='(short,short), success].
+['@>='(short,shorter), failure].
+['@>='(foo(b),foo(a)), success].
+['@>='(X,X), success].
+['@>='(foo(a,X),foo(b,Y)), failure].
+
+/* end of @>= */
+

data/spec/inriasuite/term_lt

@@ -0,0 +1,12 @@
+/* file @< */
+
+['@<'(1.0,1), success].
+['@<'(aardvark,zebra), success].
+['@<'(short,short), failure].
+['@<'(short,shorter), success].
+['@<'(foo(b),foo(a)), failure].
+['@<'(X,X), failure].
+['@<'(foo(a,X),foo(b,Y)), success].
+
+/* end of @< */
+

data/spec/inriasuite/term_lt=

@@ -0,0 +1,12 @@
+/* file @=< */
+
+['@=<'(1.0,1), success].
+['@=<'(aardvark,zebra), success].
+['@=<'(short,short), success].
+['@=<'(short,shorter), success].
+['@=<'(foo(b),foo(a)), failure].
+['@=<'(X,X), success].
+['@=<'(foo(a,X),foo(b,Y)), success].
+
+/* end of @=< */
+

data/spec/inriasuite/true

@@ -0,0 +1,7 @@
+
+/* file true */
+
+[true, success].
+
+/* end of true */
+

data/spec/inriasuite/unify

@@ -0,0 +1,18 @@
+/* file = */
+['='(1,1), success].
+['='(X,1),[[X <-- 1]]].
+['='(X,Y),[[Y <-- X]]].
+[('='(X,Y),'='(X,abc)),[[X <-- abc, Y <-- abc]]].
+['='(f(X,def),f(def,Y)), [[X <-- def, Y <-- def]]].
+['='(1,2), failure].
+['='(1,1.0), failure].
+['='(g(X),f(f(X))), failure].
+['='(f(X,1),f(a(X))), failure].
+['='(f(X,Y,X),f(a(X),a(Y),Y,2)), failure].
+['='(f(A,B,C),f(g(B,B),g(C,C),g(D,D))),
+        [[A <-- g(g(g(D,D),g(D,D)),g(g(D,D),g(D,D))),
+          B <-- g(g(D,D),g(D,D)),
+          C <-- g(D,D)]]].
+
+/* end of = */
+

data/spec/inriasuite.rb

@@ -0,0 +1,20 @@
+describe "abolish" do
+
+end
+
+describe "and" do
+  it {
+    (X.is(1).and X.var).to_a.should == []
+    (X.var.and X.is(1)).to_a.should == [1]
+    (:fail.and :call[3]).to_a.should == []
+    lambda { (:nofoo[X].and X.call).to_a }.
+      should raise_error ExistenceError
+    (X.is(:true).and X.call).should == [:true]
+  }
+end
+
+
+describe "arg" do
+
+end
+

data/spec/recursion_spec.rb

@@ -0,0 +1,18 @@
+
+require 'rubylog'
+
+class << Rubylog.theory
+  describe "recursion" do
+    specify "factorial" do
+      Integer.rubylog_functor :factorial
+      0.factorial! 1
+      N.factorial(K).if lambda{|n|n>0}.and N1.is{|n|n-1}.and N1.factorial(K1).and K.is{|n,_,_,k1|k1*n}
+
+      (0.factorial K).to_a.should == [1]
+      (1.factorial K).to_a.should == [1]
+      (2.factorial K).to_a.should == [2]
+      (3.factorial K).to_a.should == [6]
+      (4.factorial K).to_a.should == [24]
+    end
+  end
+end

data/spec/rubylog/builtins/splits_to.rb

@@ -0,0 +1,18 @@
+require 'rubylog'
+
+class << Rubylog.theory
+  describe "splits_to" do
+    specify do
+      def split_to a,b
+        be_splits_to a,b
+      end
+
+      [].should_not split_to(ANY,ANY)
+      [1].should split_to(1,[])
+      [1,2].should split_to(1,[2])
+      [1,2,3].should split_to(1,[2,3])
+
+      ([1,2,3].splits_to(B,C)).to_a.should == [[1,[2,3]]]
+    end
+  end
+end

data/spec/rubylog/clause_spec.rb

@@ -0,0 +1,81 @@
+require 'rubylog'
+
+class << Rubylog.theory
+  describe "clauses" do
+    it "can be created" do
+      (:john.is_happy).should be_kind_of Rubylog::Term
+      (:john.likes :beer).should be_kind_of Rubylog::Term
+      (A.likes :beer).should be_kind_of Rubylog::Term
+      (:john.likes Drink).should be_kind_of Rubylog::Term
+      (:john.likes :drinking.in :bar).should be_kind_of Rubylog::Term
+    end
+    it "forbids non-declared names" do
+      lambda { :john.something_else }.should raise_error(NoMethodError)
+    end
+    it "also work with operators" do
+      (:is_happy%1).should be_kind_of Rubylog::Term
+      (A%B).should be_kind_of Rubylog::Term
+    end
+    it "can be asked for their functor" do
+      (:john.is_happy).functor.should == :is_happy
+      (:is_happy%1).functor.should == :%
+      (A%1).functor.should == :%
+      (:john.likes :drinking.in :bar).functor.should == :likes
+    end
+    it "can be indexed" do
+      (:john.is_happy)[0].should == :john
+      (:john.likes :beer)[0].should == :john
+      (:john.likes :beer)[1].should == :beer
+      (:john.likes(:cold, :beer))[2].should == :beer
+      (:john.likes(:cold, :beer))[1..2].should == [:cold,:beer]
+      (:john.likes :drinking.in :bar)[1].should == (:drinking.in :bar)
+    end
+    it "can be asked for their args" do
+      (:john.is_happy).args.should == [:john]
+      (:john.likes :beer).args.should == [:john, :beer]
+      (:john.likes(:cold, :beer)).args.should == [:john, :cold, :beer]
+      (:john.likes :drinking.in :bar).args.should == [:john, :drinking.in(:bar)]
+    end
+    it "support ==" do
+      (:john.is_happy).should == (:john.is_happy)
+      (:john.is_happy).should_not be_equal(:john.is_happy)
+      (:john.is_happy).should_not == nil
+      (:john.is_happy).should_not == 9
+      (:john.is_happy).should_not == :john
+      (:john.is_happy).should_not == Rubylog
+      (:john.likes :drinking.in :bar).should == (:john.likes :drinking.in :bar)
+    end
+    it "support eql?" do
+      (:john.is_happy).should be_eql(:john.is_happy)
+      (:john.is_happy).should_not be_eql nil
+      (:john.is_happy).should_not be_eql 9
+      (:john.is_happy).should_not be_eql :john
+      (:john.is_happy).should_not be_eql Rubylog
+      (:john.likes :drinking.in :bar).should be_eql(:john.likes :drinking.in :bar)
+    end
+    it "support hash" do
+      (:john.is_happy).hash.should == (:john.is_happy).hash
+      (:john.likes :drinking.in :bar).hash.should == 
+        (:john.likes :drinking.in :bar).hash
+    end
+    it "support inspect" do
+      (:john.is_happy).inspect.should == ":john.is_happy"
+      (:john.likes :beer).inspect.should == ":john.likes(:beer)"
+      (:john.likes :drinking,:beer).inspect.should == ":john.likes(:drinking, :beer)"
+      (:john.likes :drinking.in :bar).inspect.should == ":john.likes(:drinking.in(:bar))"
+    end
+    it "can tell their arity" do
+      (:john.is_happy).arity.should == 1
+      (:john.likes :beer).arity.should == 2
+      (:john.likes :drinking,:beer).arity.should == 3
+      (:john.likes :drinking.in :bar).arity.should == 2
+    end
+    it "can tell their descriptor" do
+      (:john.is_happy).desc.should == [:is_happy,1]
+      (:john.likes :beer).desc.should == [:likes,2]
+      (:john.likes :drinking,:beer).desc.should == [:likes,3]
+      (:john.likes :drinking.in :bar).desc.should == [:likes,2]
+    end
+  end
+
+end

data/spec/rubylog/variable_spec.rb

@@ -0,0 +1,25 @@
+require 'rubylog'
+
+class << Rubylog.theory
+  describe "variables" do
+    it "are undefined constants" do 
+      [A, SomethingLong].each{|x|x.should be_kind_of Rubylog::Variable}
+    end
+
+    it "support ==" do 
+      A.should == A
+    end
+
+    it "support eql?" do
+      A.should be_eql A
+    end
+
+    it "returns different instances" do
+      A.should_not be_equal A
+    end
+
+    specify "that start with ANY... are dont care" do 
+      [ANY, ANYTHING, ANYTIME].each{|x|x.should be_kind_of Rubylog::Variable; x.should be_dont_care}
+    end
+  end
+end