FASILL documentation Predicate Reference term creation and decomposition

Term creation and decomposition

The predicates of this section are convenient for analysing and constructing terms.


Check the descomposition of a term.

'=..'( +nonvar, ?list )
'=..'( -nonvar, +list )

Term =.. List is true if and only if (1) Term is an atomic term and List is a list consisted of just one element, Term, or (2) Term is a compound term and List is a list which has the functor name of Term as head and the arguments of that functor as tail.