John Shutt has reformulated the foundations of LISP/Scheme [1]. Observing that Lambda is a primitive applicative constructor, he proposes Vau as a primitve operative constructor instead. This changes our focus from implicit evaluation to explicit evaluation. Applicatives evaluate their operands before evaluating the combination. Operatives act directly on their (unevaluated) operands, possibly evaluating them selectively. [...]
Tag Cloud
actor asynchronous blocking capability channel composition concurrency consistency data-flow deadlock debugging distribution equation Erlang evaluation extensibility functional grammar Humus imperative iteration Kernel lambda-calculus language message-passing object-oriented pair pattern-matching patterns PEG protocol queue recursion scalability Scheme sequence serializer starvation state-machine streams synchronization synchronous unification value vau-calculus