Inductive Prover Based on Equality Saturation for a Lazy Functional Language

DOI10.1007/978-3-662-46823-4_11zbMath1434.68085OpenAlexW2199924460MaRDI QIDQ3455064

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)

Cites Work

• Higher-level supercompilation as a metasystem transition
• A predicative analysis of structural recursion
• 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
• Fast Decision Procedures Based on Congruence Closure
• A positive supercompiler
• Automating Inductive Proofs Using Theory Exploration
• Equality saturation

This page was built for publication: Inductive Prover Based on Equality Saturation for a Lazy Functional Language