Hi Martin,
I'm a bit disappointed by your pamphlet. It doesn't have any references
to external literature. You don't even mention something as useful as
http://en.wikipedia.org/wiki/De_Bruijn_index.
Obviously, your Lambda domain implements lambda calculus with and
without variables. But without any explanation, your representation:
https://github.com/hemmecke/fricas-svn/blob/master/src/algebra/computation.spad.pamphlet#L1263
Rep := Union(_
boundTerm:Record(varBound:NNI),_
freeTerm:UT,_
compoundTerm:Record(c1:%, c2:%),_
lambdaTerm:Record(c3:%, nm:UT)_
)
Does not really look like the grammar from wikipedia
M, N, ... ::= n | M N | lambda M
Would be nice to actually describe your choice for this representation
more carefully. That would be the idea of literate programming.
Ralf
--
You received this message because you are subscribed to the Google Groups "FriCAS -
computer algebra system" group.
To post to this group, send email to [email protected].
To unsubscribe from this group, send email to
[email protected].
For more options, visit this group at
http://groups.google.com/group/fricas-devel?hl=en.
