A systematic study of functional language implementations
ACM Transactions on Programming Languages and Systems (TOPLAS)
Improvement in a lazy context: an operational theory for call-by-need
Proceedings of the 26th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Possibilities and limitations of call-by-need space improvement
Proceedings of the sixth ACM SIGPLAN international conference on Functional programming
A Framework for Defining Object-Calculi
FM '99 Proceedings of the Wold Congress on Formal Methods in the Development of Computing Systems-Volume II
Compilation of extended recursion in call-by-value functional languages
Proceedings of the 5th ACM SIGPLAN international conference on Principles and practice of declaritive programming
Reductions, intersection types, and explicit substitutions
Mathematical Structures in Computer Science
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
Explaining the lazy Krivine machine using explicit substitution and addresses
Higher-Order and Symbolic Computation
Higher-Order and Symbolic Computation
Term-Graph Rewriting Via Explicit Paths
RTA '08 Proceedings of the 19th international conference on Rewriting Techniques and Applications
Addressed Term Rewriting Systems: Syntax, Semantics, and Pragmatics
Electronic Notes in Theoretical Computer Science (ENTCS)
Reductions, intersection types, and explicit substitutions
TLCA'01 Proceedings of the 5th international conference on Typed lambda calculi and applications
Converting between combinatory reduction systems and big step semantics
Semantics and algebraic specification
Hi-index | 0.00 |