A term pattern-match compiler inspired by finite automata theory
- 1 January 1992
- book chapter
- Published by Springer Nature
- p. 258-270
- https://doi.org/10.1007/3-540-55984-1_24
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Report on the programming language HaskellACM SIGPLAN Notices, 1992
- A runtime systemHigher-Order and Symbolic Computation, 1990
- Compiling pattern matching by term decompositionPublished by Association for Computing Machinery (ACM) ,1990
- Code generation using tree matching and dynamic programmingACM Transactions on Programming Languages and Systems, 1989
- Continuation-passing, closure-passing stylePublished by Association for Computing Machinery (ACM) ,1989
- ORBIT: an optimizing compiler for schemeACM SIGPLAN Notices, 1986
- Producing good code for the case statementSoftware: Practice and Experience, 1985
- Compiling pattern matchingLecture Notes in Computer Science, 1985
- Compiling a functional languagePublished by Association for Computing Machinery (ACM) ,1984
- Pattern Matching in TreesJournal of the ACM, 1982