Optimal derivations in weak lambda-calculi and in orthogonal term rewriting systems
POPL '91 Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Partial evaluation is fuller laziness
PEPM '91 Proceedings of the 1991 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
Combinatory weak reduction in lambda calculus
Theoretical Computer Science
The optimal implementation of functional programming languages
The optimal implementation of functional programming languages
Weak Orthogonality Implies Confluence: The Higher Order Case
LFCS '94 Proceedings of the Third International Symposium on Logical Foundations of Computer Science
Relative Normalization in Deterministic Residual Structures
CAAP '96 Proceedings of the 21st International Colloquium on Trees in Algebra and Programming
ACM Transactions on Programming Languages and Systems (TOPLAS)
Complete Laziness: a Natural Semantics
Electronic Notes in Theoretical Computer Science (ENTCS)
Theoretical Computer Science
Compiling pattern matching to good decision trees
Proceedings of the 2008 ACM SIGPLAN workshop on ML
Journal of Functional Programming
Pattern Calculus: Computing with Functions and Structures
Pattern Calculus: Computing with Functions and Structures
Recursive Functions with Pattern Matching in Interaction Nets
Electronic Notes in Theoretical Computer Science (ENTCS)
Addressed Term Rewriting Systems: Syntax, Semantics, and Pragmatics
Electronic Notes in Theoretical Computer Science (ENTCS)
ESOP'06 Proceedings of the 15th European conference on Programming Languages and Systems
| Hi-index | 0.00 |
Evaluation of a weak calculus featuring expressive pattern matching mechanisms is investigated by means of the construction of an efficient model of sharing. The sharing theory and its graph implementation are based on a labelling system derived from an analysis of causality relations between evaluation steps. The labelled calculus enjoys properties of confluence and finite developments, and is also used for proving correctness and optimality of a whole set of reduction strategies.