Pattern minimization problems over recursive data types

DOI10.1145/1411204.1411242MaRDI QIDQ5178767zbMATH OpenOpenAlexFDO

Authors Alexander Krauss

Publication date 16 March 2015

Published in Proceedings of the 13th ACM SIGPLAN international conference on Functional programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/1411204.1411242

zbMATH Keywords

complexitypattern matchingtheorem proving

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Specification and verification (program logics, model checking, etc.) (68Q60) Functional programming and lambda calculus (68N18)

Recommendations

• PATTERN MATCHING CODE MINIMIZATION IN REWRITING-BASED PROGRAMMING LANGUAGES
• Recycling proof patterns in Coq: case studies
• Verifying higher-order functional programs with pattern-matching algebraic data types
• Partiality and recursion in interactive theorem provers -- an overview
• Advances in Computing Science – ASIAN 2003. Progamming Languages and Distributed Computation Programming Languages and Distributed Computation

Cited in

(1)

• Pattern matches in HOL: a new representation and improved code generation

Describes a project that uses

Uses Software

• HOL
• Haskell
• Isabelle/HOL

This page was built for publication: Pattern minimization problems over recursive data types

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5178767)