Conditional rewriting logic as a unified model of concurrency
Selected papers of the Second Workshop on Concurrency and compositionality
A natural semantics for lazy evaluation
POPL '93 Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Specification and proof in membership equational logic
Theoretical Computer Science - Trees in algebra and programming
An operational semantics for parallel lazy evaluation
ICFP '00 Proceedings of the fifth ACM SIGPLAN international conference on Functional programming
Parallel functional programming in Eden
Journal of Functional Programming
Towards a Strategy Language for Maude
Electronic Notes in Theoretical Computer Science (ENTCS)
Typed Mobile Ambients in Maude
Electronic Notes in Theoretical Computer Science (ENTCS)
Deduction, Strategies, and Rewriting
Electronic Notes in Theoretical Computer Science (ENTCS)
Strategies and simulations in a semantic framework
Journal of Algorithms
Hi-index | 0.00 |
We use the @r-calculus as an intermediate language to compile functional languages with pattern-matching features, and give an interaction net encoding of the @r-terms arising from the compilation. This encoding gives rise to new strategies of evaluation, ...