Compilation of pattern matching with associative-commutative functions
- 1 January 1991
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Programming in equational logic: beyond strong sequentialityPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Compiling pattern matching by term decompositionPublished by Association for Computing Machinery (ACM) ,1990
- A new method for undecidability proofs of first order theoriesPublished by Springer Nature ,1990
- Refined compiliation of pattern-matching for functional languagesScience of Computer Programming, 1988
- Complexity of matching problemsJournal of Symbolic Computation, 1987
- Lazy pattern matching in the ML languageLecture Notes in Computer Science, 1987
- Fast many-to-one matching algorithmsPublished by Springer Nature ,1985
- Compiling pattern matchingLecture Notes in Computer Science, 1985