A higher-order implementation of rewriting

DOI10.1016/0167-6423(83)90008-4MaRDI QIDQ800739zbMATH OpenOpenAlexWikidataFDO

Authors Lawrence C. Paulson

Publication date 1983

Published in Science of Computer Programming (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/cs/9301108

zbMATH Keywords

pattern matchingMLformula conversionsimplementation of rewriting in LCFlogic of computable functionsterm conversions

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Computability and recursion theory on ordinals, admissible sets, etc. (03D60) Abstract data types; algebraic specification (68Q65)

Abstract: Many automatic theorem-provers rely on rewriting. Using theorems as rewrite rules helps to simplify the subgoals that arise during a proof. LCF is an interactive theorem-prover intended for reasoning about computation. Its implementation of rewriting is presented in detail. LCF provides a family of rewriting functions, and operators to combine them. A succession of functions is described, from pattern matching primitives to the rewriting tool that performs most inferences in LCF proofs. The design is highly modular. Each function performs a basic, specific task, such as recognizing a certain form of tautology. Each operator implements one method of building a rewriting function from simpler ones. These pieces can be put together in numerous ways, yielding a variety of rewrit- ing strategies. The approach involves programming with higher-order functions. Rewriting functions are data values, produced by computation on other rewriting functions. The code is in daily use at Cambridge, demonstrating the practical use of functional programming.

Recommendations

• Term rewriting and beyond -- theorem proving in Isabelle
• Rewriting conversions implemented with continuations
• Transparent optimisation of rewriting combinators
• Proving and rewriting
• Formal proofs about rewriting using ACL2

Cited in

(25)

• scientific article; zbMATH DE number 1231655 (Why is no real title available?)
• Scalable fine-grained proofs for formula processing
• Rewriting with a nondeterministic choice operator
• A comparison of HOL and ALF formalizations of a categorical coherence theorem
• A Mizar mode for HOL
• Function definition in higher-order logic
• Term rewriting and beyond -- theorem proving in Isabelle
• Typed generic traversal with term rewriting strategies
• scientific article; zbMATH DE number 7340567 (Why is no real title available?)
• scientific article; zbMATH DE number 2043545 (Why is no real title available?)
• REWRITING WITH STRATEGIES IN $\mathsf{ELAN}$: A FUNCTIONAL SEMANTICS
• A few exercises in theorem processing
• Lazy techniques for fully expansive theorem proving
• Crystal: Integrating structured queries into a tactic language
• Rewriting conversions implemented with continuations
• scientific article; zbMATH DE number 512772 (Why is no real title available?)
• Equational Reasoning with Applicative Functors
• A metatheory of a mechanized object theory
• Transforming optimization problems into disciplined convex programming form
• n-level rewriting systems
• Generic type-preserving traversal strategies
• Understanding and maintaining tactics graphically OR how we are learning that a diagram can be worth more than 10K LoC
• An overview of the Tecton proof system
• An account of implementing applicative term rewriting
• A restricted form of higher-order rewriting applied to an HDL semantics

This page was built for publication: A higher-order implementation of rewriting

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