Optimality and inefficiency: what isn't a cost model of the lambda calculus?
Proceedings of the first ACM SIGPLAN international conference on Functional programming
On global dynamics of optimal graph reduction
ICFP '97 Proceedings of the second ACM SIGPLAN international conference on Functional programming
Parallel beta reduction is not elementary recursive
POPL '98 Proceedings of the 25th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Linear-Time Self-Interpretation of the Pure Lambda Calculus
Higher-Order and Symbolic Computation
Parallel beta reduction is not elementary recursive
Information and Computation
| Hi-index | 0.00 |