|  |  | 
term.Function(term.BuiltIn)
BI_keyLength(term.LightBuiltIn, term.Function, term.ReverseFunction)
BI_md5(term.LightBuiltIn, term.Function)
BI_publicKey(term.LightBuiltIn, term.Function)
BI_sha(term.LightBuiltIn, term.Function)
BI_sign(term.LightBuiltIn, term.Function)
BI_verifyBoolean(term.LightBuiltIn, term.Function)
term.LightBuiltIn(term.GenericBuiltIn)
BI_keyLength(term.LightBuiltIn, term.Function, term.ReverseFunction)
BI_md5(term.LightBuiltIn, term.Function)
BI_publicKey(term.LightBuiltIn, term.Function)
BI_sha(term.LightBuiltIn, term.Function)
BI_sign(term.LightBuiltIn, term.Function)
BI_verify
BI_verifyBoolean(term.LightBuiltIn, term.Function)
term.ReverseFunction(term.BuiltIn)
BI_keyLength(term.LightBuiltIn, term.Function, term.ReverseFunction)
 
 
| class BI_keyLength(term.LightBuiltIn, term.Function, term.ReverseFunction)
 |  |  |  | Method resolution order:BI_keyLengthterm.LightBuiltInterm.GenericBuiltInterm.Functionterm.ReverseFunctionterm.BuiltInterm.Fragmentterm.LabelledNodeterm.Nodeterm.Term__builtin__.object
 Methods defined here:
 
 __init__(self, resource, fragid)
 evaluateObject(self, subj_py)
 evaluateSubject(self, obj_py)Generates an RSA keypair, and spews it out as plain text.Has the limitation that it will *only* ever let you generate
 one key pair (per iteration), in order to work around a bug.
 Methods inherited from term.Function:
 
 eval(self, subj, obj, queue, bindings, proof, query)
 evalObj(self, subj, queue, bindings, proof, query)This function which has access to the store, unless overridden,calls a simpler one which uses python conventions.
 
 To reduce confusion, the inital ones called with the internals available
 use abreviations "eval", "subj" etc while the python-style ones use "evaluate", "subject", etc.
 Methods inherited from term.ReverseFunction:
 
 evalSubj(self, obj, queue, bindings, proof, query)This function which has access to the store, unless overridden,calls a simpler one which uses python conventions
 Static methods inherited from term.BuiltIn:
 
 __new__(cls, *args, **keywords)
 Data and other attributes inherited from term.BuiltIn:
 
 all = []
 Methods inherited from term.Fragment:
 
 dereference(self, mode='', workingContext=None)dereference an identifyer, finding the semantics of its schema if any
 Returns None if it cannot be retreived.
 generated(self)A generated identifier?This arises when a document is parsed and a arbitrary
 name is made up to represent a node with no known URI.
 It is useful to know that its ID has no use outside that
 context.
 representation(self, base=None)Optimize output if prefixes available
 uriref(self)
 uriref2(self, base)
 Methods inherited from term.LabelledNode:
 
 classOrder(self)
 compareTerm(self, other)Assume is also a LabelledNode - see function compareTerm in formula.py
 Methods inherited from term.Term:
 
 __repr__(self)This method only used for debugging output - it can be ambiguous,as it is is deliberately short to make debug printout readable.
 
 output as XML qnames [http://www.w3.org/TR/REC-xml-names/#NT-QName].
 This could be beefed up to guarantee unambiguity.
 asPair(self)Representation in an earlier format, being phased out 2002/08
 The first part of the pair is a constant number represnting the type
 see RDFSink.py.  the second is the value -- uri for symbols, string for literals
 compareAnyTerm(self, other)Compare two langauge itemsThis is a cannoncial ordering in that is designed to allow
 the same graph always to be printed in the same order.
 This makes the regression tests possible.
 The literals are deemed smaller than symbols, which are smaller
 than formulae.  This puts the rules at the botom of a file where
 they tend to take a lot of space anyway.
 Formulae have to be compared as a function of their sorted contents.
 
 @@ Anonymous nodes have to, within a given Formula, be compared as
 a function of the sorted information about them in that context.
 This is not done yet
 debugString(self, already)
 doesNodeAppear(self, symbol)Does that node appear within this one
 This non-overloaded function will simply return if I'm equal to him
 occurringIn(self, vars)
 substituteEquals(self, bindings, newRedirections)Return this or a version of me with substitution made
 substitution(self, bindings, why=None)Return this or a version of me with subsitution made
 unify(self, other, vars, existentials, bindings)Unify this which may contain variables with the other,which may contain existentials but not variables.
 Return 0 if impossible.
 return [({}, reason] if no new bindings
 Return [( {var1: val1, var2: val2,...}, reason), ...] if match
 value(self)As a python value - by default, none exists, use self
 Data and other attributes inherited from term.Term:
 
 __dict__ = <dictproxy object>dictionary for instance variables (if defined)
 __weakref__ = <attribute '__weakref__' of 'Term' objects>list of weak references to the object (if defined)
 |  
 
| class BI_md5(term.LightBuiltIn, term.Function)
 |  |  |  | Method resolution order:BI_md5term.LightBuiltInterm.GenericBuiltInterm.Functionterm.BuiltInterm.Fragmentterm.LabelledNodeterm.Nodeterm.Term__builtin__.object
 Methods defined here:
 
 evaluateObject(self, subj_py)
 Methods inherited from term.GenericBuiltIn:
 
 __init__(self, resource, fragid)
 Methods inherited from term.Function:
 
 eval(self, subj, obj, queue, bindings, proof, query)
 evalObj(self, subj, queue, bindings, proof, query)This function which has access to the store, unless overridden,calls a simpler one which uses python conventions.
 
 To reduce confusion, the inital ones called with the internals available
 use abreviations "eval", "subj" etc while the python-style ones use "evaluate", "subject", etc.
 Static methods inherited from term.BuiltIn:
 
 __new__(cls, *args, **keywords)
 Data and other attributes inherited from term.BuiltIn:
 
 all = []
 Methods inherited from term.Fragment:
 
 dereference(self, mode='', workingContext=None)dereference an identifyer, finding the semantics of its schema if any
 Returns None if it cannot be retreived.
 generated(self)A generated identifier?This arises when a document is parsed and a arbitrary
 name is made up to represent a node with no known URI.
 It is useful to know that its ID has no use outside that
 context.
 representation(self, base=None)Optimize output if prefixes available
 uriref(self)
 uriref2(self, base)
 Methods inherited from term.LabelledNode:
 
 classOrder(self)
 compareTerm(self, other)Assume is also a LabelledNode - see function compareTerm in formula.py
 Methods inherited from term.Term:
 
 __repr__(self)This method only used for debugging output - it can be ambiguous,as it is is deliberately short to make debug printout readable.
 
 output as XML qnames [http://www.w3.org/TR/REC-xml-names/#NT-QName].
 This could be beefed up to guarantee unambiguity.
 asPair(self)Representation in an earlier format, being phased out 2002/08
 The first part of the pair is a constant number represnting the type
 see RDFSink.py.  the second is the value -- uri for symbols, string for literals
 compareAnyTerm(self, other)Compare two langauge itemsThis is a cannoncial ordering in that is designed to allow
 the same graph always to be printed in the same order.
 This makes the regression tests possible.
 The literals are deemed smaller than symbols, which are smaller
 than formulae.  This puts the rules at the botom of a file where
 they tend to take a lot of space anyway.
 Formulae have to be compared as a function of their sorted contents.
 
 @@ Anonymous nodes have to, within a given Formula, be compared as
 a function of the sorted information about them in that context.
 This is not done yet
 debugString(self, already)
 doesNodeAppear(self, symbol)Does that node appear within this one
 This non-overloaded function will simply return if I'm equal to him
 occurringIn(self, vars)
 substituteEquals(self, bindings, newRedirections)Return this or a version of me with substitution made
 substitution(self, bindings, why=None)Return this or a version of me with subsitution made
 unify(self, other, vars, existentials, bindings)Unify this which may contain variables with the other,which may contain existentials but not variables.
 Return 0 if impossible.
 return [({}, reason] if no new bindings
 Return [( {var1: val1, var2: val2,...}, reason), ...] if match
 value(self)As a python value - by default, none exists, use self
 Data and other attributes inherited from term.Term:
 
 __dict__ = <dictproxy object>dictionary for instance variables (if defined)
 __weakref__ = <attribute '__weakref__' of 'Term' objects>list of weak references to the object (if defined)
 |  
 
| class BI_publicKey(term.LightBuiltIn, term.Function)
 |  |  |  | Method resolution order:BI_publicKeyterm.LightBuiltInterm.GenericBuiltInterm.Functionterm.BuiltInterm.Fragmentterm.LabelledNodeterm.Nodeterm.Term__builtin__.object
 Methods defined here:
 
 evaluateObject(self, subj_py)Generate a quopri public key from a keypair.
 Methods inherited from term.GenericBuiltIn:
 
 __init__(self, resource, fragid)
 Methods inherited from term.Function:
 
 eval(self, subj, obj, queue, bindings, proof, query)
 evalObj(self, subj, queue, bindings, proof, query)This function which has access to the store, unless overridden,calls a simpler one which uses python conventions.
 
 To reduce confusion, the inital ones called with the internals available
 use abreviations "eval", "subj" etc while the python-style ones use "evaluate", "subject", etc.
 Static methods inherited from term.BuiltIn:
 
 __new__(cls, *args, **keywords)
 Data and other attributes inherited from term.BuiltIn:
 
 all = []
 Methods inherited from term.Fragment:
 
 dereference(self, mode='', workingContext=None)dereference an identifyer, finding the semantics of its schema if any
 Returns None if it cannot be retreived.
 generated(self)A generated identifier?This arises when a document is parsed and a arbitrary
 name is made up to represent a node with no known URI.
 It is useful to know that its ID has no use outside that
 context.
 representation(self, base=None)Optimize output if prefixes available
 uriref(self)
 uriref2(self, base)
 Methods inherited from term.LabelledNode:
 
 classOrder(self)
 compareTerm(self, other)Assume is also a LabelledNode - see function compareTerm in formula.py
 Methods inherited from term.Term:
 
 __repr__(self)This method only used for debugging output - it can be ambiguous,as it is is deliberately short to make debug printout readable.
 
 output as XML qnames [http://www.w3.org/TR/REC-xml-names/#NT-QName].
 This could be beefed up to guarantee unambiguity.
 asPair(self)Representation in an earlier format, being phased out 2002/08
 The first part of the pair is a constant number represnting the type
 see RDFSink.py.  the second is the value -- uri for symbols, string for literals
 compareAnyTerm(self, other)Compare two langauge itemsThis is a cannoncial ordering in that is designed to allow
 the same graph always to be printed in the same order.
 This makes the regression tests possible.
 The literals are deemed smaller than symbols, which are smaller
 than formulae.  This puts the rules at the botom of a file where
 they tend to take a lot of space anyway.
 Formulae have to be compared as a function of their sorted contents.
 
 @@ Anonymous nodes have to, within a given Formula, be compared as
 a function of the sorted information about them in that context.
 This is not done yet
 debugString(self, already)
 doesNodeAppear(self, symbol)Does that node appear within this one
 This non-overloaded function will simply return if I'm equal to him
 occurringIn(self, vars)
 substituteEquals(self, bindings, newRedirections)Return this or a version of me with substitution made
 substitution(self, bindings, why=None)Return this or a version of me with subsitution made
 unify(self, other, vars, existentials, bindings)Unify this which may contain variables with the other,which may contain existentials but not variables.
 Return 0 if impossible.
 return [({}, reason] if no new bindings
 Return [( {var1: val1, var2: val2,...}, reason), ...] if match
 value(self)As a python value - by default, none exists, use self
 Data and other attributes inherited from term.Term:
 
 __dict__ = <dictproxy object>dictionary for instance variables (if defined)
 __weakref__ = <attribute '__weakref__' of 'Term' objects>list of weak references to the object (if defined)
 |  
 
| class BI_sha(term.LightBuiltIn, term.Function)
 |  |  |  | Method resolution order:BI_shaterm.LightBuiltInterm.GenericBuiltInterm.Functionterm.BuiltInterm.Fragmentterm.LabelledNodeterm.Nodeterm.Term__builtin__.object
 Methods defined here:
 
 evaluateObject(self, subj_py)
 Methods inherited from term.GenericBuiltIn:
 
 __init__(self, resource, fragid)
 Methods inherited from term.Function:
 
 eval(self, subj, obj, queue, bindings, proof, query)
 evalObj(self, subj, queue, bindings, proof, query)This function which has access to the store, unless overridden,calls a simpler one which uses python conventions.
 
 To reduce confusion, the inital ones called with the internals available
 use abreviations "eval", "subj" etc while the python-style ones use "evaluate", "subject", etc.
 Static methods inherited from term.BuiltIn:
 
 __new__(cls, *args, **keywords)
 Data and other attributes inherited from term.BuiltIn:
 
 all = []
 Methods inherited from term.Fragment:
 
 dereference(self, mode='', workingContext=None)dereference an identifyer, finding the semantics of its schema if any
 Returns None if it cannot be retreived.
 generated(self)A generated identifier?This arises when a document is parsed and a arbitrary
 name is made up to represent a node with no known URI.
 It is useful to know that its ID has no use outside that
 context.
 representation(self, base=None)Optimize output if prefixes available
 uriref(self)
 uriref2(self, base)
 Methods inherited from term.LabelledNode:
 
 classOrder(self)
 compareTerm(self, other)Assume is also a LabelledNode - see function compareTerm in formula.py
 Methods inherited from term.Term:
 
 __repr__(self)This method only used for debugging output - it can be ambiguous,as it is is deliberately short to make debug printout readable.
 
 output as XML qnames [http://www.w3.org/TR/REC-xml-names/#NT-QName].
 This could be beefed up to guarantee unambiguity.
 asPair(self)Representation in an earlier format, being phased out 2002/08
 The first part of the pair is a constant number represnting the type
 see RDFSink.py.  the second is the value -- uri for symbols, string for literals
 compareAnyTerm(self, other)Compare two langauge itemsThis is a cannoncial ordering in that is designed to allow
 the same graph always to be printed in the same order.
 This makes the regression tests possible.
 The literals are deemed smaller than symbols, which are smaller
 than formulae.  This puts the rules at the botom of a file where
 they tend to take a lot of space anyway.
 Formulae have to be compared as a function of their sorted contents.
 
 @@ Anonymous nodes have to, within a given Formula, be compared as
 a function of the sorted information about them in that context.
 This is not done yet
 debugString(self, already)
 doesNodeAppear(self, symbol)Does that node appear within this one
 This non-overloaded function will simply return if I'm equal to him
 occurringIn(self, vars)
 substituteEquals(self, bindings, newRedirections)Return this or a version of me with substitution made
 substitution(self, bindings, why=None)Return this or a version of me with subsitution made
 unify(self, other, vars, existentials, bindings)Unify this which may contain variables with the other,which may contain existentials but not variables.
 Return 0 if impossible.
 return [({}, reason] if no new bindings
 Return [( {var1: val1, var2: val2,...}, reason), ...] if match
 value(self)As a python value - by default, none exists, use self
 Data and other attributes inherited from term.Term:
 
 __dict__ = <dictproxy object>dictionary for instance variables (if defined)
 __weakref__ = <attribute '__weakref__' of 'Term' objects>list of weak references to the object (if defined)
 |  
 
| class BI_sign(term.LightBuiltIn, term.Function)
 |  |  |  | Method resolution order:BI_signterm.LightBuiltInterm.GenericBuiltInterm.Functionterm.BuiltInterm.Fragmentterm.LabelledNodeterm.Nodeterm.Term__builtin__.object
 Methods defined here:
 
 evaluateObject(self, subj_py)Sign a hash with a key, and get a signature back.
 Methods inherited from term.GenericBuiltIn:
 
 __init__(self, resource, fragid)
 Methods inherited from term.Function:
 
 eval(self, subj, obj, queue, bindings, proof, query)
 evalObj(self, subj, queue, bindings, proof, query)This function which has access to the store, unless overridden,calls a simpler one which uses python conventions.
 
 To reduce confusion, the inital ones called with the internals available
 use abreviations "eval", "subj" etc while the python-style ones use "evaluate", "subject", etc.
 Static methods inherited from term.BuiltIn:
 
 __new__(cls, *args, **keywords)
 Data and other attributes inherited from term.BuiltIn:
 
 all = []
 Methods inherited from term.Fragment:
 
 dereference(self, mode='', workingContext=None)dereference an identifyer, finding the semantics of its schema if any
 Returns None if it cannot be retreived.
 generated(self)A generated identifier?This arises when a document is parsed and a arbitrary
 name is made up to represent a node with no known URI.
 It is useful to know that its ID has no use outside that
 context.
 representation(self, base=None)Optimize output if prefixes available
 uriref(self)
 uriref2(self, base)
 Methods inherited from term.LabelledNode:
 
 classOrder(self)
 compareTerm(self, other)Assume is also a LabelledNode - see function compareTerm in formula.py
 Methods inherited from term.Term:
 
 __repr__(self)This method only used for debugging output - it can be ambiguous,as it is is deliberately short to make debug printout readable.
 
 output as XML qnames [http://www.w3.org/TR/REC-xml-names/#NT-QName].
 This could be beefed up to guarantee unambiguity.
 asPair(self)Representation in an earlier format, being phased out 2002/08
 The first part of the pair is a constant number represnting the type
 see RDFSink.py.  the second is the value -- uri for symbols, string for literals
 compareAnyTerm(self, other)Compare two langauge itemsThis is a cannoncial ordering in that is designed to allow
 the same graph always to be printed in the same order.
 This makes the regression tests possible.
 The literals are deemed smaller than symbols, which are smaller
 than formulae.  This puts the rules at the botom of a file where
 they tend to take a lot of space anyway.
 Formulae have to be compared as a function of their sorted contents.
 
 @@ Anonymous nodes have to, within a given Formula, be compared as
 a function of the sorted information about them in that context.
 This is not done yet
 debugString(self, already)
 doesNodeAppear(self, symbol)Does that node appear within this one
 This non-overloaded function will simply return if I'm equal to him
 occurringIn(self, vars)
 substituteEquals(self, bindings, newRedirections)Return this or a version of me with substitution made
 substitution(self, bindings, why=None)Return this or a version of me with subsitution made
 unify(self, other, vars, existentials, bindings)Unify this which may contain variables with the other,which may contain existentials but not variables.
 Return 0 if impossible.
 return [({}, reason] if no new bindings
 Return [( {var1: val1, var2: val2,...}, reason), ...] if match
 value(self)As a python value - by default, none exists, use self
 Data and other attributes inherited from term.Term:
 
 __dict__ = <dictproxy object>dictionary for instance variables (if defined)
 __weakref__ = <attribute '__weakref__' of 'Term' objects>list of weak references to the object (if defined)
 |  
 
| class BI_verify(term.LightBuiltIn)
 |  |  |  | Method resolution order:BI_verifyterm.LightBuiltInterm.GenericBuiltInterm.BuiltInterm.Fragmentterm.LabelledNodeterm.Nodeterm.Term__builtin__.object
 Methods defined here:
 
 evaluate(self, subj_py, obj_py)Verify a hash/signature.
 Methods inherited from term.GenericBuiltIn:
 
 __init__(self, resource, fragid)
 Methods inherited from term.BuiltIn:
 
 eval(self, subj, obj, queue, bindings, proof, query)This function which has access to the store, unless overridden,calls a simpler one which uses python conventions.
 
 To reduce confusion, the inital ones called with the internals available
 use abreviations "eval", "subj" etc while the python-style ones use evaluate, subject, etc.
 Static methods inherited from term.BuiltIn:
 
 __new__(cls, *args, **keywords)
 Data and other attributes inherited from term.BuiltIn:
 
 all = []
 Methods inherited from term.Fragment:
 
 dereference(self, mode='', workingContext=None)dereference an identifyer, finding the semantics of its schema if any
 Returns None if it cannot be retreived.
 generated(self)A generated identifier?This arises when a document is parsed and a arbitrary
 name is made up to represent a node with no known URI.
 It is useful to know that its ID has no use outside that
 context.
 representation(self, base=None)Optimize output if prefixes available
 uriref(self)
 uriref2(self, base)
 Methods inherited from term.LabelledNode:
 
 classOrder(self)
 compareTerm(self, other)Assume is also a LabelledNode - see function compareTerm in formula.py
 Methods inherited from term.Term:
 
 __repr__(self)This method only used for debugging output - it can be ambiguous,as it is is deliberately short to make debug printout readable.
 
 output as XML qnames [http://www.w3.org/TR/REC-xml-names/#NT-QName].
 This could be beefed up to guarantee unambiguity.
 asPair(self)Representation in an earlier format, being phased out 2002/08
 The first part of the pair is a constant number represnting the type
 see RDFSink.py.  the second is the value -- uri for symbols, string for literals
 compareAnyTerm(self, other)Compare two langauge itemsThis is a cannoncial ordering in that is designed to allow
 the same graph always to be printed in the same order.
 This makes the regression tests possible.
 The literals are deemed smaller than symbols, which are smaller
 than formulae.  This puts the rules at the botom of a file where
 they tend to take a lot of space anyway.
 Formulae have to be compared as a function of their sorted contents.
 
 @@ Anonymous nodes have to, within a given Formula, be compared as
 a function of the sorted information about them in that context.
 This is not done yet
 debugString(self, already)
 doesNodeAppear(self, symbol)Does that node appear within this one
 This non-overloaded function will simply return if I'm equal to him
 occurringIn(self, vars)
 substituteEquals(self, bindings, newRedirections)Return this or a version of me with substitution made
 substitution(self, bindings, why=None)Return this or a version of me with subsitution made
 unify(self, other, vars, existentials, bindings)Unify this which may contain variables with the other,which may contain existentials but not variables.
 Return 0 if impossible.
 return [({}, reason] if no new bindings
 Return [( {var1: val1, var2: val2,...}, reason), ...] if match
 value(self)As a python value - by default, none exists, use self
 Data and other attributes inherited from term.Term:
 
 __dict__ = <dictproxy object>dictionary for instance variables (if defined)
 __weakref__ = <attribute '__weakref__' of 'Term' objects>list of weak references to the object (if defined)
 |  
 
| class BI_verifyBoolean(term.LightBuiltIn, term.Function)
 |  |  |  | Method resolution order:BI_verifyBooleanterm.LightBuiltInterm.GenericBuiltInterm.Functionterm.BuiltInterm.Fragmentterm.LabelledNodeterm.Nodeterm.Term__builtin__.object
 Methods defined here:
 
 evaluateObject(self, subj_py)Verify a hash/signature.
 Methods inherited from term.GenericBuiltIn:
 
 __init__(self, resource, fragid)
 Methods inherited from term.Function:
 
 eval(self, subj, obj, queue, bindings, proof, query)
 evalObj(self, subj, queue, bindings, proof, query)This function which has access to the store, unless overridden,calls a simpler one which uses python conventions.
 
 To reduce confusion, the inital ones called with the internals available
 use abreviations "eval", "subj" etc while the python-style ones use "evaluate", "subject", etc.
 Static methods inherited from term.BuiltIn:
 
 __new__(cls, *args, **keywords)
 Data and other attributes inherited from term.BuiltIn:
 
 all = []
 Methods inherited from term.Fragment:
 
 dereference(self, mode='', workingContext=None)dereference an identifyer, finding the semantics of its schema if any
 Returns None if it cannot be retreived.
 generated(self)A generated identifier?This arises when a document is parsed and a arbitrary
 name is made up to represent a node with no known URI.
 It is useful to know that its ID has no use outside that
 context.
 representation(self, base=None)Optimize output if prefixes available
 uriref(self)
 uriref2(self, base)
 Methods inherited from term.LabelledNode:
 
 classOrder(self)
 compareTerm(self, other)Assume is also a LabelledNode - see function compareTerm in formula.py
 Methods inherited from term.Term:
 
 __repr__(self)This method only used for debugging output - it can be ambiguous,as it is is deliberately short to make debug printout readable.
 
 output as XML qnames [http://www.w3.org/TR/REC-xml-names/#NT-QName].
 This could be beefed up to guarantee unambiguity.
 asPair(self)Representation in an earlier format, being phased out 2002/08
 The first part of the pair is a constant number represnting the type
 see RDFSink.py.  the second is the value -- uri for symbols, string for literals
 compareAnyTerm(self, other)Compare two langauge itemsThis is a cannoncial ordering in that is designed to allow
 the same graph always to be printed in the same order.
 This makes the regression tests possible.
 The literals are deemed smaller than symbols, which are smaller
 than formulae.  This puts the rules at the botom of a file where
 they tend to take a lot of space anyway.
 Formulae have to be compared as a function of their sorted contents.
 
 @@ Anonymous nodes have to, within a given Formula, be compared as
 a function of the sorted information about them in that context.
 This is not done yet
 debugString(self, already)
 doesNodeAppear(self, symbol)Does that node appear within this one
 This non-overloaded function will simply return if I'm equal to him
 occurringIn(self, vars)
 substituteEquals(self, bindings, newRedirections)Return this or a version of me with substitution made
 substitution(self, bindings, why=None)Return this or a version of me with subsitution made
 unify(self, other, vars, existentials, bindings)Unify this which may contain variables with the other,which may contain existentials but not variables.
 Return 0 if impossible.
 return [({}, reason] if no new bindings
 Return [( {var1: val1, var2: val2,...}, reason), ...] if match
 value(self)As a python value - by default, none exists, use self
 Data and other attributes inherited from term.Term:
 
 __dict__ = <dictproxy object>dictionary for instance variables (if defined)
 __weakref__ = <attribute '__weakref__' of 'Term' objects>list of weak references to the object (if defined)
 |  |