Solving recursive domain equations by term rewriting
- 1 January 1994
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Benchmarking implementations of lazy functional languagesPublished by Association for Computing Machinery (ACM) ,1993
- Strictness analysis using abstract reductionPublished by Association for Computing Machinery (ACM) ,1993
- Implementing Haskell overloadingPublished by Association for Computing Machinery (ACM) ,1993
- Polymorphic strictness analysis using frontiersPublished by Association for Computing Machinery (ACM) ,1993
- Abstract Interpretation of Higher Order Functions using Concrete Data Structures (Summary)Published by Springer Nature ,1993
- Fixed points and frontiers: a new perspectiveJournal of Functional Programming, 1991
- Attribute grammars as a functional programming paradigmPublished by Springer Nature ,1987
- Data flow analysis of applicative programs using minimal function graphsPublished by Association for Computing Machinery (ACM) ,1986