Incidentally I did find a solution that fits into the type system and also
produces the correct result. This was done by making the global parameter
change type as well at each lambda so that it becomes a function with the
same arrity as the term. Unfortunately to evaluate these terms the program
I'm probably not the best person to answer your questions but here is a try:
I refer to my language as a mini language because I'm only showing lamda,
application and extension. You might choose to add other features like
symbol definitions, fixed points, pattern matching etc. which in the more
Hi Ian,
I have a couple of questions for you -
1. Could you explain why a lambda calculus like language embedded in
Haskell would be useful - I ask this because, the way I understand, Haskell
is already such a language - one could easily chose to restrict oneself to
just function definition and
Hi,
I've been working on this problem for some time and I was hoping for some
feedback. I'm trying to implement an embedded language that can thread a
global structure through the evaluation of a term.
A mini version of this language only includes three functions, lam, app and
ext (lambda, apply
