| Home | Trees | Indices | Help |
|
|---|
|
|
Expression --+
|
ApplicationExpression
An application expression: (M N).
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
Inherited from |
|||
|
|||
|
fun Every ApplicationExpression has a functor. |
|||
|
op Only some ApplicationExpressions have operators. |
|||
|
args Every ApplicationExpression has args. |
|||
|
|||
|
Are the two expressions equal, modulo alpha conversion?
|
Set of all variables.
|
Set of free variables.
|
Set of all subterms (including self).
|
Replace all instances of variable v with expression E in self, where v is free in self.
|
Evaluate the form by repeatedly applying applications.
|
|
|
|
|
|
|||
funEvery ApplicationExpression has a functor.
|
opOnly some ApplicationExpressions have operators.
|
argsEvery ApplicationExpression has args.
|
| Home | Trees | Indices | Help |
|
|---|
| Generated by Epydoc 3.0beta1 on Wed May 16 22:47:31 2007 | http://epydoc.sourceforge.net |