Introduction to combinators and &lgr;-calculus
Introduction to combinators and &lgr;-calculus
Lambda-calculus on occurrence. The theory and its combinatorial counterpart
Journal of Information Processing and Cybernetics
Categorical Combinators, Sequential Algorithms and Funtional Programming
Categorical Combinators, Sequential Algorithms and Funtional Programming
The Implementation of Functional Programming Languages (Prentice-Hall International Series in Computer Science)
Linear logic and permutation stacks—the Forth shall be first
ACM SIGARCH Computer Architecture News - Special issue: panel sessions of the 1991 workshop on multithreaded computers
| Hi-index | 0.00 |
We describe, in this article, O. LISP: a functional language based on the manipulation of expressions issued from the syntax of lambda-calculus on occurrence (λ()-caculus [8]). In this theoretical framework, the functions are constructed without variables, we essentially use indexes of occurrences and basic terms.In O. LISP new primitives, like SUBO or UNSUBO, realize, respectively, a substitution (without variable, by creating links between numbers of occurrences and arguments) and a locking on some of these links.A first version of O. LISP has been implemented on a LISP interpret We present, at the end of this article, some examples which are extracted from this implementation.