An effective method for handling initial algebras

This publication has 10 references indexed in Scilit:

• A decidability result about sufficient-completeness of axiomatically specified abstract data types
  Published by Springer Nature ,2006
• Models and equality for logical programming
  Published by Springer Nature ,2005
• Refined compilation of pattern-matching for functional languages
  Published by Springer Nature ,1988
• Laws in Miranda
  Published by Association for Computing Machinery (ACM) ,1986
• Sufficient completeness, term rewriting systems and ”anti-unification”
  Published by Springer Nature ,1986
• Complexity of sufficient-completeness
  Published by Springer Nature ,1986
• Reductions in tree replacement systems
  Theoretical Computer Science, 1985
• Semantic confluence tests and completion methods
  Information and Control, 1985
• Stop losing sleep over incomplete data type specifications
  Published by Association for Computing Machinery (ACM) ,1984
• Proofs by induction in equational theories with constructors
  Journal of Computer and System Sciences, 1982