Home | Trees | Index | Help |
|
---|
Package nltk_lite :: Package parse :: Module lambdacalculus :: Class Expression |
|
ApplicationExpression
,
VariableBinderExpression
,
VariableExpression
Method Summary | |
---|---|
__init__(self)
| |
__eq__(self,
other)
| |
__hash__(self)
| |
__ne__(self,
other)
| |
__repr__(self)
| |
__str__(self)
| |
Are the two expressions equal, modulo alpha conversion? | |
Set of free variables. | |
Replace all instances of variable v with expression E in self, where v is free in self. | |
Evaluate the form by repeatedly applying applications. | |
Perform a simple Skolemisation operation. | |
Set of all subterms (including self). | |
Set of all variables. | |
_skolemise(self,
bound_vars,
counter)
|
Method Details |
---|
equals(self, other)Are the two expressions equal, modulo alpha conversion? |
free(self)Set of free variables. |
replace(self, variable, expression)Replace all instances of variable v with expression E in self, where v is free in self. |
simplify(self)Evaluate the form by repeatedly applying applications. |
skolemise(self)Perform a simple Skolemisation operation. Existential quantifiers are simply dropped and all variables they introduce are renamed so that they are unique. |
subterms(self)Set of all subterms (including self). |
variables(self)Set of all variables. |
Home | Trees | Index | Help |
|
---|
Generated by Epydoc 2.1 on Tue Sep 5 09:37:22 2006 | http://epydoc.sf.net |