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
Games Characterizing Levy-Longo Trees
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
The Fine Structure of Game Lambda Models
FST TCS 2000 Proceedings of the 20th Conference on Foundations of Software Technology and Theoretical Computer Science
Extending partial combinatory algebras
Mathematical Structures in Computer Science
Games characterizing Levy-Longo trees
Theoretical Computer Science - Special issue on automata, languages and programming
Strong normalisation in the π-calculus
Information and Computation
RTA '08 Proceedings of the 19th international conference on Rewriting Techniques and Applications
RTA '09 Proceedings of the 20th International Conference on Rewriting Techniques and Applications
Game semantics for the pure lazy λ-calculus
TLCA'01 Proceedings of the 5th international conference on Typed lambda calculi and applications
The Cost of Usage in the ?-Calculus
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
| Hi-index | 0.00 |