Proc. of a conference on Functional programming languages and computer architecture
Introduction to HOL: a theorem proving environment for higher order logic
Introduction to HOL: a theorem proving environment for higher order logic
Polynomial-time algorithms for generation of prime implicants
Journal of Complexity
Contemporary logic design
Proceedings of the sixth ACM SIGPLAN international conference on Functional programming
The Haskell: The Craft of Functional Programming
The Haskell: The Craft of Functional Programming
Logic Minimization Algorithms for VLSI Synthesis
Logic Minimization Algorithms for VLSI Synthesis
The Design of a Pretty-printing Library
Advanced Functional Programming, First International Spring School on Advanced Functional Programming Techniques-Tutorial Text
Approximability and completeness in the polynomial hierarchy
Approximability and completeness in the polynomial hierarchy
Red-black trees in a functional setting
Journal of Functional Programming
Optimising parallel pattern-matching by source-level program transformation
ACSC '05 Proceedings of the Twenty-eighth Australasian conference on Computer Science - Volume 38
Isabelle/HOL: a proof assistant for higher-order logic
Isabelle/HOL: a proof assistant for higher-order logic
Verifying mixed real-integer quantifier elimination
IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
Complexity of two-level logic minimization
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
| Hi-index | 0.00 |
In the context of program verification in an interactive theorem prover, we study the problem of transforming function definitions with ML-style (possibly overlapping) pattern matching into minimal sets of independent equations. Since independent equations are valid unconditionally, they are better suited for the equational proof style using induction and rewriting, which is often found in proofs in theorem provers or on paper. We relate the problem to the well-known minimization problem for propositional DNF formulas and show that it is £P/2-complete. We then develop a concrete algorithm to compute minimal patterns, which naturally generalizes the standard Quine-McCluskey procedure to the domain of term patterns.