A Term Pattern-Match Compiler Inspired by Finite Automata Theory

Mikael Pettersson. A Term Pattern-Match Compiler Inspired by Finite Automata Theory. In Uwe Kastens, Peter Pfahler, editors, Compiler Construction, 4th International Conference on Compiler Construction, CC 92, Paderborn, Germany, October 5-7, 1992, Proceedings. Volume 641 of Lecture Notes in Computer Science, pages 258-270, Springer, 1992. [doi]

Abstract

Abstract is missing.