bim.pl |
| bim_expansion/2 | goal_expansion rules to emulate YAP behaviour in SWI-Prolog. |  |
| index/2 | Index in the given arguments. |  |
hprolog.pl -- hProlog compatibility library |
| bounded_sublist/3 | As sublist/2, but Sub has at most Bound elements. |  |
| chr_delete/3 | Rest is a copy of List without elements matching Element using ==. |  |
| drop/3 | Drop the first N elements from List and unify the remainder with LastElements. |  |
| intersect_eq/3 | Determine the intersection of two lists without unifying values. |  |
| list_difference_eq/3 | Delete all elements of Subtract from List and unify the result with Rest. |  |
| max_go_list/2 | Return the maximum of List in the standard order of terms. |  |
| memberchk_eq/2 | Deterministic check of membership using == rather than unification. |  |
| or_list/2 | Do a bitwise disjuction over all integer members of ListOfInts. |  |
| split_at/4 | Combines take/3 and drop/3. |  |
| sublist/2 | True if all elements of Sub appear in List in the same order. |  |
| substitute_eq/4 | Substitute OldVal by NewVal in OldList and unify the result with NewList. |  |
| take/3 | Take the first N elements from List and unify this with FirstElements. |  |
| time/3 | hProlog compatible predicate to for statistical purposes. |  |
ifprolog.pl -- IF/Prolog compatibility package |
sicstus.pl -- SICStus 3 compatibility library |
sicstus4.pl -- SICStus 4 compatibility library |
xsb.pl -- XSB Prolog compatibility layer |
yap.pl -- YAP Compatibility module |