Incremental reduction in the lambda calculus
LFP '90 Proceedings of the 1990 ACM conference on LISP and functional programming
On laziness and optimality in lambda interpreters: tools for specification and analysis
POPL '90 Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Call by need computations to root-stable form
Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The essence of computation
Demonstrating lambda calculus reduction
The essence of computation
A Logical Interpretation of the λ-Calculus into the η-Calculus, Preserving Spine Reduction and Types
CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
Making "stricterness" more relevant
Proceedings of the 2010 ACM SIGPLAN workshop on Partial evaluation and program manipulation
RTA'07 Proceedings of the 18th international conference on Term rewriting and applications
Making "stricterness" more relevant
Higher-Order and Symbolic Computation
A unified approach to fully lazy sharing
POPL '12 Proceedings of the 39th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Expression reduction systems and extensions: an overview
Processes, Terms and Cycles
Highlights in infinitary rewriting and lambda calculus
Theoretical Computer Science
Weak optimality, and the meaning of sharing
Proceedings of the 18th ACM SIGPLAN international conference on Functional programming
A nonstandard standardization theorem
Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages
| Hi-index | 0.01 |