A call-by-need lambda calculus
POPL '95 Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Semantics of barriers in a non-strict, implicitly-parallel language
FPCA '95 Proceedings of the seventh international conference on Functional programming languages and computer architecture
First-class synchronization barriers
Proceedings of the first ACM SIGPLAN international conference on Functional programming
A model for comparing the space usage of lazy evaluators
Proceedings of the 2nd ACM SIGPLAN international conference on Principles and practice of declarative programming
The call-by-need lambda calculus
Journal of Functional Programming
Addressed term rewriting systems: application to a typed object calculus
Mathematical Structures in Computer Science
Infinite Unfolding and Transformations of Nondeterministic Programs
Fundamenta Informaticae - Program Transformation: Theoretical Foundations and Basic Techniques. Part 1
Safety of nöcker's strictness analysis
Journal of Functional Programming
Addressed Term Rewriting Systems: Syntax, Semantics, and Pragmatics
Electronic Notes in Theoretical Computer Science (ENTCS)
Three syntactic theories for combinatory graph reduction
LOPSTR'10 Proceedings of the 20th international conference on Logic-based program synthesis and transformation
Skew and ω-skew confluence and abstract Böhm semantics
Processes, Terms and Cycles
Infinite Unfolding and Transformations of Nondeterministic Programs
Fundamenta Informaticae - Program Transformation: Theoretical Foundations and Basic Techniques. Part 1
Three syntactic theories for combinatory graph reduction
ACM Transactions on Computational Logic (TOCL)
Hi-index | 5.23 |