diogo/yap-6.3
Archived
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

rational trees

Browse Source
This commit is contained in:
Vítor Santos Costa
2019-02-02 22:33:18 +00:00
parent fa96ffa932
commit 38610c0b0d
5 changed files with 139 additions and 96 deletions
Download Patch File Download Diff File Expand all files Collapse all files

13
C/utilpreds.c
View File

@@ -3847,19 +3847,6 @@ void Yap_InitUtilCPreds(void)
*/
Yap_InitCPred("is_list", 1, p_is_list, SafePredFlag|TestPredFlag);
Yap_InitCPred("$is_list_or_partial_list", 1, p_is_list_or_partial_list, SafePredFlag|TestPredFlag);
Yap_InitCPred("rational_term_to_tree", 4, p_break_rational, 0);
/** @pred rational_term_to_tree(? _TI_,- _TF_, ?SubTerms, ?MoreSubterms)
The term _TF_ is a forest representation (without cycles and repeated
terms) for the Prolog term _TI_. The term _TF_ is the main term. The
difference list _SubTerms_-_MoreSubterms_ stores terms of the form
_V=T_, where _V_ is a new variable occuring in _TF_, and _T_ is a copy
of a sub-term from _TI_.
*/
Yap_InitCPred("term_factorized", 3, p_break_rational3, 0);
/** @pred term_factorized(? _TI_,- _TF_, ?SubTerms)