Home | Trees | Index | Help |
|
---|
Package nltk_lite :: Package parse :: Module lambdacalculus :: Class ApplicationExpression |
|
Expression
--+
|
ApplicationExpression
ApplicationExpressionSubst
Method Summary | |
---|---|
__init__(self,
first,
second)
| |
__hash__(self)
| |
__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. | |
Set of all subterms (including self). | |
Set of all variables. | |
_skolemise(self,
bound_vars,
counter)
| |
Inherited from Expression :
__eq__ ,
__ne__ ,
skolemise
|
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.
|
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:21 2006 | http://epydoc.sf.net |