Page 1 of 1
Posted: Sep 29th, '18, 15:15
This request is a bit of a long shot, but would it be possible to implement Lambda calculus and fully implement first-class functions?
Re: Lambda Calculus?
Posted: Jun 3rd, '19, 13:48
GP doesn't have closures, but it does have first-class functions. It also has "Action" objects. An Action is a sort of "explicit lambda" -- a way to bundle up a set of variable bindings in a closure-like object that can evaluated.
My advice for those who want to explore closures in a blocks language is to try Snap! The Snap! team has put a lot of thought into how to integrate closures into a blocks language and how to teach them. (I suspect you already use Snap!, so this is advice for other GP Forum readers.)