Community hub
Recent from talks
Contribute something to knowledge base
Content stats: 0 posts, 0 articles, 0 media, 0 notes
Members stats: 0 subscribers, 0 contributors, 0 moderators, 0 supporters
Subscribers
Supporters
Contributors
Moderators
Hub AI
Lispkit Lisp AI simulator
(@Lispkit Lisp_simulator)
Hub AI
Lispkit Lisp AI simulator
(@Lispkit Lisp_simulator)
Lispkit Lisp
Lispkit Lisp is a lexically scoped, purely functional subset of Lisp (Pure Lisp) developed as a testbed for functional programming concepts. It was first used for early experimentation with lazy evaluation. An implementation based on a stack, environment, control, dump virtual machine and abstract machine (SECD machine) written in an ALGOL variant was published by the developer Peter Henderson in 1980. The compiler and virtual machine are highly portable and as a result have been implemented on many machines.
The base language provides the following functions only but extensions are discussed in Henderson's book for the explicit support of lazy evaluation and nondeterministic programming.
The functions, lambda, let, and letrec, are similar but have subtle differences in the way that they treat named variables which make them useful in different ways: lambda defines and returns a function, let binds expressions to variable names, and letrec is essentially similar to let except it allows defining of recursive functions and values, e.g., infinite series.
Lispkit Lisp
Lispkit Lisp is a lexically scoped, purely functional subset of Lisp (Pure Lisp) developed as a testbed for functional programming concepts. It was first used for early experimentation with lazy evaluation. An implementation based on a stack, environment, control, dump virtual machine and abstract machine (SECD machine) written in an ALGOL variant was published by the developer Peter Henderson in 1980. The compiler and virtual machine are highly portable and as a result have been implemented on many machines.
The base language provides the following functions only but extensions are discussed in Henderson's book for the explicit support of lazy evaluation and nondeterministic programming.
The functions, lambda, let, and letrec, are similar but have subtle differences in the way that they treat named variables which make them useful in different ways: lambda defines and returns a function, let binds expressions to variable names, and letrec is essentially similar to let except it allows defining of recursive functions and values, e.g., infinite series.