Inductive prover based on equality saturation for a lazy functional language

DOI10.1007/978-3-662-46823-4_11MaRDI QIDQ3455064zbMATH OpenOpenAlexFDO

Authors Sergei Grechanik

Publication date 3 December 2015

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-662-46823-4_11

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18)

Recommendations

• Proving properties of functional programs by equality saturation
• Combining induction and saturation-based theorem proving
• Inductionless induction
• Proofs by induction in equational theories with constructors
• Inductive proofs by specification transformations

Cites work

• A positive supercompiler
• A predicative analysis of structural recursion
• Automating Inductive Proofs Using Theory Exploration
• Equality saturation
• Fast Decision Procedures Based on Congruence Closure
• Higher-level supercompilation as a metasystem transition
• Multi-result supercompilation as branching growth of the penultimate level in metasystem transitions
• Simplify: a theorem prover for program checking
• The concept of a supercompiler

Cited in

(4)

• Proving properties of functional programs by equality saturation
• scientific article; zbMATH DE number 5007860 (Why is no real title available?)
• scientific article; zbMATH DE number 5677418 (Why is no real title available?)
• The correctness of a higher-order lazy functional language implementation: An exercise in mechanical theorem proving

This page was built for publication: Inductive prover based on equality saturation for a lazy functional language

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