215 Lines

cardinality(tset(S),R) :- !, set_cardinality(S,R).

cardinality(setFromTo(int(Low),int(Up)),R) :- !, R=int(C), when((ground(Low),ground(Up)), C is Up-Low+1).

cardinality(X,_R) :- add_error(csp_set,'Could not compute card: ',X),fail.

Calls:

Name: fail
Name: add_error/3	Module: foo_error
Name: is/2
Name: ground/1
Name: when/2
Name: =/2
Name: !
Name: set_cardinality/2	Module: foo_error

closure_expand/2

closure_expand(ListOfEls,ExpandedList) :-
    %print(closure_expand(ListOfEls)),nl,
    when(ground(ListOfEls),
    (findall(EEl,(member(El,ListOfEls),
    closure_expand_single_element(El,EEl)),EEls),
    %print(expanded(EEls)),nl,
    sort(EEls,ExpandedList) /* is sort ok wrt to @< used by various set operations?? */
)).

Calls:

Name: sort/2
Name: findall/3
Name: ground/1
Name: when/2

Called:

Name: expand_symbolic_set/2

Module: csp_tsets.pl

closure_expand_single_element/2

closure_expand_single_element(pat(List,Ch),R) :-
    channel_type_list(Ch,ChannelTypeList),!, R = pat(NewList,Ch),
    gen_expanded_list(ChannelTypeList,List,NewList,Ch).

closure_expand_single_element(X,R) :-
    add_error(csp_set,'Cannot closure expand: ',X),
    X=R.

Calls:

Name: =/2
Name: add_error/3	Module: foo_error
Name: gen_expanded_list/4	Module: csp_tsets.pl
Name: !
Name: channel_type_list/2	Module: foo_error

diff_set/3

diff_set(S1,S2,Res) :- Res = tset(R), expand_symbolic_set(S1,tset(ES1)),
expand_symbolic_set(S2,tset(ES2)),
when(ground((ES1,ES2)),diff_set(ES1,ES2,R)).

Calls:

Name: RECURSIVE_CALL/3	Module: csp_tsets.pl
Name: ground/1
Name: when/2
Name: expand_symbolic_set/2	Module: csp_tsets.pl
Name: =/2

equal_element/2

equal_element(X,Y) :- var(X),!,X=Y.

equal_element(int(X),R) :- !, (R=int(Y) -> X=Y ; (add_error(haskell_csp,'Type error in equality: ',int(X)=R),fail)).

equal_element(set(X),R) :- !, (R=set(Y) -> X=Y ; (add_error(haskell_csp,'Type error in equality: ',set(X)=R),fail)).

equal_element(X,X).

Calls:

Name: fail
Name: add_error/3	Module: foo_error
Name: =/2
Name: ->/3
Name: !
Name: var/1

evaluate_closure/2

evaluate_closure(X,tclosure(RS)) :- evaluate_set(X,tset(RS)).

Calls:

Name: evaluate_set/2

Module: csp_tsets.pl

evaluate_set/2

evaluate_set(List,tset(Tree)) :- evaluate_list(List,EL), list_to_tree(EL,Tree).

Calls:

Name: list_to_tree/2	Module: foo_error
Name: evaluate_list/2	Module: foo_error

Called:

Name: expand_set_comprehension/3	Module: csp_tsets.pl
Name: evaluate_closure/2	Module: csp_tsets.pl

expand_datatypedefbody/2

expand_datatypedefbody([],R) :- !, R=[].

expand_datatypedefbody([constructor(C)|T],R) :- !, R=[C|ET],
    expand_datatypedefbody(T,ET).

expand_datatypedefbody(L,R) :-
    add_error(csp_sets,'Could not expand datatype body: ',L),
    R=L.

Calls:

Name: =/2
Name: add_error/3	Module: foo_error
Name: RECURSIVE_CALL/2	Module: csp_tsets.pl
Name: !

Called:

Name: expand_symbolic_set/2

Module: csp_tsets.pl

expand_from_to/3

expand_from_to(X,Y,R) :- X>Y,!, R=[].

expand_from_to(X,Y,[int(X)|T]) :- X1 is X+1, expand_from_to(X1,Y,T).

Calls:

Name: RECURSIVE_CALL/3	Module: csp_tsets.pl
Name: is/2
Name: =/2
Name: !
Name: >/2

Called:

Name: expand_symbolic_set/2

Module: csp_tsets.pl

expand_set_comprehension/3

expand_set_comprehension(ExprList,GeneratorList,Res) :-
    treat_generators(GeneratorList,Vars,Sets,Guard),
    when(ground(Sets),
    (findall(Expr,(check_boolean_expression(Guard),
    generator_sol(Vars,Sets),
    member(Expr,ExprList)),Expressions),
    evaluate_set(Expressions,Res))).

Calls:

Name: evaluate_set/2	Module: csp_tsets.pl
Name: findall/3
Name: ground/1
Name: when/2
Name: treat_generators/4	Module: csp_tsets.pl

Called:

Name: expand_symbolic_set/2

Module: csp_tsets.pl

expand_symbolic_set/2

expand_symbolic_set(dataType(T),R) :- !, R=tset(TR),
    (dataTypeDef(T,Def)
    -> %print(dt(T,Def,SET)),nl,
    expand_datatypedefbody(Def,SET),list_to_set(SET,TR)
    ; add_error(csp_sets,'Could not expand dataType. No datatype definition for: ',T),fail
).

expand_symbolic_set(closure(X),Res) :- !, closure_expand(X,R),list_to_set(R,TR),
    Res= tset(TR).

expand_symbolic_set(tset(X),R) :- !, R=tset(X).

expand_symbolic_set(setFromTo(int(Low),int(Up)),R) :- !,
    when((ground(Low),ground(Up)),
    (expand_from_to(Low,Up,RS),list_to_set(RS,TRS),R=tset(TRS))).

expand_symbolic_set(setComp(GeneratorList,tuple(ExprList)),R) :- !,
    expand_set_comprehension(ExprList,GeneratorList,R).

expand_symbolic_set(Set,R) :- add_error(haskell_csp,'Could not expand set: ',Set),R=Set.

Calls:

Name: =/2
Name: add_error/3	Module: foo_error
Name: expand_set_comprehension/3	Module: csp_tsets.pl
Name: !
Name: list_to_set/2	Module: foo_error
Name: expand_from_to/3	Module: csp_tsets.pl
Name: ground/1
Name: when/2
Name: closure_expand/2	Module: csp_tsets.pl
Name: fail
Name: expand_datatypedefbody/2	Module: csp_tsets.pl
Name: dataTypeDef/2	Module: foo_error
Name: ->/3

Called:

Name: union_set/3	Module: csp_tsets.pl
Name: diff_set/3	Module: csp_tsets.pl
Name: treat_generators/4	Module: csp_tsets.pl
Name: inter_set/3	Module: csp_tsets.pl

gen_expanded_list/4

gen_expanded_list([],List,[],Channel) :-
    (List=[] -> true ; add_error(csp_sets,'Patter List too long for channel:',(List,Channel))).

gen_expanded_list([Type|TT],List,Res,Channel) :-
    (List=[H|LT] -> Res=[H|RT]
    ; (Res=[NewEl|RT],LT=List, /* is it ok not to put dot(NewEl) here ? */
    %print(enum(Type,Channel)),nl,
    enumerate_channel_input_value(Type,NewEl))
    ),
    gen_expanded_list(TT,LT,RT,Channel).

Calls:

Name: RECURSIVE_CALL/4	Module: csp_tsets.pl
Name: enumerate_channel_input_value/2	Module: foo_error
Name: =/2
Name: ->/3
Name: add_error/3	Module: foo_error
Name: true

Called:

Name: closure_expand_single_element/2

Module: csp_tsets.pl

generator_sol/2

generator_sol([],[]).

generator_sol([Var|VT],[Set|ST]) :- is_member_set(Var,Set), generator_sol(VT,ST).

Calls:

Name: RECURSIVE_CALL/2	Module: csp_tsets.pl
Name: is_member_set/2	Module: csp_tsets.pl

Called:

Name: is_member_comprehension_set/3

Module: csp_tsets.pl

inter_set/3

inter_set(S1,S2,Res) :- Res = tset(R), expand_symbolic_set(S1,tset(ES1)),
expand_symbolic_set(S2,tset(ES2)),
when(ground((ES1,ES2)),inter_set(ES1,ES2,R)).

Calls:

Name: RECURSIVE_CALL/3	Module: csp_tsets.pl
Name: ground/1
Name: when/2
Name: expand_symbolic_set/2	Module: csp_tsets.pl
Name: =/2

is_a_set/1

is_a_set(tset(_)). /* a tree compiled set */

is_a_set(tclosure(_)). /* a tree compiled set */

is_a_set(setFromTo(_,_)).

is_a_set(intType).

is_a_set(dataType(_)).

is_a_set(setComp(_,_)).

is_empty_set/1

is_empty_set(tset(X)) :- !, empty_set(X).

is_empty_set(tclosure(X)) :- !, empty_set(X).

is_empty_set(setFromTo(int(Low),int(Up))) :- !,
when((ground(Low),ground(Up)), Low>Up).

is_empty_set(X) :- add_error(csp_set,'Could not evaluate: ',is_empty_set(X)),fail.

Calls:

Name: fail
Name: add_error/3	Module: foo_error
Name: >/2
Name: ground/1
Name: when/2
Name: !
Name: empty_set/1	Module: foo_error

is_member_comprehension_set/3

is_member_comprehension_set(X,tuple(ExprList),GeneratorList) :-
    treat_generators(GeneratorList,Vars,Sets,Guard),
    when(ground(Sets),
    (check_boolean_expression(Guard),
    generator_sol(Vars,Sets),
    member(Expr,ExprList),
    evaluate_argument(Expr,X))).

Calls:

Name: evaluate_argument/2	Module: foo_error
Name: member/2
Name: generator_sol/2	Module: csp_tsets.pl
Name: check_boolean_expression/1	Module: foo_error
Name: ground/1
Name: when/2
Name: treat_generators/4	Module: csp_tsets.pl

Called:

Name: is_member_set/2	Module: csp_tsets.pl
Name: lazy_is_member_set/2	Module: csp_tsets.pl

is_member_set/2

is_member_set(El,tset(T)) :- generate_elements_of_set(El,T).

is_member_set(int(_),intType) :- !.

is_member_set(int(X),setFromTo(int(Low),int(Up))) :- !,
    when(ground(X), (when(ground(Low),X>=Low), when(ground(Up),X=<Up))).

is_member_set(C,dataType(DT)) :- dataTypeDef(DT,L), /* to do: precompute this */
    member(constructor(C),L),!.

is_member_set(C,setComp(GeneratorSet,Tuple)) :- !,
    is_member_comprehension_set(C,Tuple,GeneratorSet),
    print(is_member_comprehension_set(C,Tuple,GeneratorSet)),nl.

is_member_set(X,R) :- add_error(csp_set,'Could not evaluate: ',member(X,R)),fail.

Calls:

Name: fail
Name: add_error/3	Module: foo_error
Name: nl
Name: print/1
Name: is_member_comprehension_set/3	Module: csp_tsets.pl
Name: !
Name: member/2
Name: dataTypeDef/2	Module: foo_error
Name: =</2
Name: ground/1
Name: when/2
Name: >=/2
Name: generate_elements_of_set/2	Module: foo_error

Called:

Name: generator_sol/2	Module: csp_tsets.pl
Name: lazy_is_member_set/2	Module: csp_tsets.pl

lazy_is_member_set/2

lazy_is_member_set(int(X),setFromTo(int(Low),int(Up))) :- !,
    when(ground(X), (when(ground(Low),X>=Low), when(ground(Up),X=<Up))).

lazy_is_member_set(El,tset(T)) :- when(ground(El),is_element_of_set(El,T)).

lazy_is_member_set(C,setComp(GeneratorSet,Tuple)) :- !,
    when(ground(C),is_member_comprehension_set(C,Tuple,GeneratorSet)),
    print(is_member_comprehension_set(C,Tuple,GeneratorSet)),nl.

lazy_is_member_set(El,S) :- is_member_set(El,S).

Calls:

Name: is_member_set/2	Module: csp_tsets.pl
Name: nl
Name: print/1
Name: is_member_comprehension_set/3	Module: csp_tsets.pl
Name: ground/1
Name: when/2
Name: !
Name: is_element_of_set/2	Module: foo_error
Name: =</2
Name: >=/2

not_equal_element/2

not_equal_element(X,Y) :- var(X),!,dif(X,Y).

not_equal_element(int(X),R) :- !, (R=int(Y) -> X\=Y ; (add_error(haskell_csp,'Type error in disequality: ',int(X)\=R),fail)).

not_equal_element(set(X),R) :- !, (R=set(Y) -> X\=Y ; (add_error(haskell_csp,'Type error in disequality: ',set(X)\=R),fail)).

not_equal_element(X,Y) :- dif(X,Y).

Calls:

Name: dif/2
Name: fail
Name: add_error/3	Module: foo_error
Name: \=/2
Name: =/2
Name: ->/3
Name: !
Name: var/1

treat_generators/4

treat_generators([],V,S,G) :- !, V=[], S=[], G=true.

treat_generators([comprehensionGenerator(Var,Set)|T],Vars,Sets,TG) :- !, Vars=[Var|VT], Sets=[ESet|ST],
    evaluate_argument(Set,EvSet),expand_symbolic_set(EvSet,ESet),
    treat_generators(T,VT,ST,TG).

treat_generators([comprehensionGuard(Guard)|T],VT,ST,bool_and(Guard,TGuard)) :- !,
    treat_generators(T,VT,ST,TGuard).

treat_generators(G,_,_,_) :- add_error(csp_set,'Could not treat Set Comprehension Generator List: ',G),fail.

Calls:

Name: fail
Name: add_error/3	Module: foo_error
Name: RECURSIVE_CALL/4	Module: csp_tsets.pl
Name: !
Name: expand_symbolic_set/2	Module: csp_tsets.pl
Name: evaluate_argument/2	Module: foo_error
Name: =/2

Called:

Name: is_member_comprehension_set/3	Module: csp_tsets.pl
Name: expand_set_comprehension/3	Module: csp_tsets.pl

union_set/3

union_set(S1,S2,Res) :- Res = tset(R), expand_symbolic_set(S1,tset(ES1)),
expand_symbolic_set(S2,tset(ES2)),
when(ground((ES1,ES2)),union_set(ES1,ES2,R)) , print(union(S1,S2,Res)),nl.

Calls:

Name: nl
Name: print/1
Name: RECURSIVE_CALL/3	Module: csp_tsets.pl
Name: ground/1
Name: when/2
Name: expand_symbolic_set/2	Module: csp_tsets.pl
Name: =/2

Determinacy Checker

Determinacy Checker:

! Existence error in argument 1 of absolute_file_name/3
! file sets does not exist
! goal: absolute_file_name(sets,_2655,[access(exist),file_type(source),relative_to('/builds/stups/prob/prolog_doc_gen/prolog-Doc/prob_prolog/unused_code/csp_tsets.pl')])
* Non-determinate: user:is_member_set/2 (clause 1)
* Indexing cannot distinguish this from clause 2.
* Non-determinate: user:lazy_is_member_set/2 (clause 2)
* Indexing cannot distinguish this from clause 3.

csp_tsets.pl

prob_prolog/unused_code/csp_tsets.pl

Modules

Predicates of csp_tsets.pl

Module Information

215 Lines

22 Predicates

Imported Modules: sets

0 Exports

0 specified Imports

Predicates:

cardinality/2

closure_expand/2

closure_expand_single_element/2

diff_set/3

equal_element/2

evaluate_closure/2

evaluate_set/2

expand_datatypedefbody/2

expand_from_to/3

expand_set_comprehension/3

expand_symbolic_set/2

gen_expanded_list/4

generator_sol/2

inter_set/3

is_a_set/1

is_empty_set/1

is_member_comprehension_set/3

is_member_set/2

lazy_is_member_set/2

not_equal_element/2

treat_generators/4

union_set/3

Determinacy Checker: