Relating conflict-free stable transition and event models via redex families
Theoretical Computer Science
RtA '99 Proceedings of the 10th International Conference on Rewriting Techniques and Applications
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
The conflict-free reduction geometry
Theoretical Computer Science
Stable computational semantics of conflict-free rewrite systems (partial orders with duplication)
RTA'03 Proceedings of the 14th international conference on Rewriting techniques and applications
Optimality for dynamic patterns
Proceedings of the 12th international ACM SIGPLAN symposium on Principles and practice of declarative programming
A unified approach to fully lazy sharing
POPL '12 Proceedings of the 39th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Weak optimality, and the meaning of sharing
Proceedings of the 18th ACM SIGPLAN international conference on Functional programming
| Hi-index | 0.00 |