September 22, 1999 | Perl and the Lambda Calculus | Slide #33 |
We showed how to construct booleans, conditionals, data structures, numbers, and recursive functions
That's a real programming language
Now let's try it out
How?
Usual approach: Write an interpreter
Parser for -expressions
Evaluator substitutes arguments into -expressions
Not too difficult
Ho hum
Next | Copyright © 1999 M-J. Dominus |