Introduction to combinators and &lgr;-calculus
Introduction to combinators and &lgr;-calculus
Proofs and types
An algorithm for optimal lambda calculus reduction
POPL '90 Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
What is an efficient implementation of the &lgr;-calculus?
Proceedings of the 5th ACM conference on Functional programming languages and computer architecture
A simple proof of a theorem of Statman
Theoretical Computer Science
The geometry of optimal lambda reduction
POPL '92 Proceedings of the 19th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
From proof-nets to interaction nets
Proceedings of the workshop on Advances in linear logic
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 the complexity of beta-reduction
POPL '96 Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
On global dynamics of optimal graph reduction
ICFP '97 Proceedings of the second ACM SIGPLAN international conference on Functional programming
The optimal implementation of functional programming languages
The optimal implementation of functional programming languages
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Correct and optimal implementations of recursion in a simple programming language
Journal of Computer and System Sciences
Relating typability and expressiveness in finite-rank intersection type systems (extended abstract)
Proceedings of the fourth ACM SIGPLAN international conference on Functional programming
(Optimal) duplication is not elementary recursive
Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Relating conflict-free stable transition and event models via redex families
Theoretical Computer Science
Static Analysis of Modularity of beta-Reduction in the Hyperbalanced lambda-Calculus
RTA '02 Proceedings of the 13th International Conference on Rewriting Techniques and Applications
Coherence for sharing proof-nets
Theoretical Computer Science - Linear logic
Unique decomposition categories, Geometry of Interaction and combinatory logic
Mathematical Structures in Computer Science
(Optimal) duplication is not elementary recursive
Information and Computation
PELCR: Parallel environment for optimal lambda-calculus reduction
ACM Transactions on Computational Logic (TOCL)
Relating complexity and precision in control flow analysis
ICFP '07 Proceedings of the 12th ACM SIGPLAN international conference on Functional programming
Strongly reducing variants of the Krivine abstract machine
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
| Hi-index | 0.00 |