Pages that link to "Item:Q800739"

The following pages link to A higher-order implementation of rewriting (Q800739):

Displaying 23 items.

• A few exercises in theorem processing (Q879370) (← links)
• Term rewriting and beyond -- theorem proving in Isabelle (Q909488) (← links)
• n-level rewriting systems (Q1084855) (← links)
• Rewriting with a nondeterministic choice operator (Q1096383) (← links)
• Lazy techniques for fully expansive theorem proving (Q1309245) (← links)
• An overview of the Tecton proof system (Q1341710) (← links)
• Typed generic traversal with term rewriting strategies (Q1394988) (← links)
• Rewriting conversions implemented with continuations (Q2655323) (← links)
• Crystal: Integrating structured queries into a tactic language (Q2655333) (← links)
• A metatheory of a mechanized object theory (Q2676562) (← links)
• Equational Reasoning with Applicative Functors (Q2829262) (← links)
• Generic type-preserving traversal strategies (Q2841223) (← links)
• (Q4222980) (← links)
• (Q4281465) (← links)
• (Q4986740) (← links)
• A restricted form of higher-order rewriting applied to an HDL semantics (Q5055839) (← links)
• Understanding and maintaining tactics graphically OR how we are learning that a diagram can be worth more than 10K LoC (Q5195279) (← links)
• REWRITING WITH STRATEGIES IN $\mathsf{ELAN}$: A FUNCTIONAL SEMANTICS (Q5249248) (← links)
• Scalable fine-grained proofs for formula processing (Q5919479) (← links)
• A comparison of HOL and ALF formalizations of a categorical coherence theorem (Q6567701) (← links)
• A Mizar mode for HOL (Q6567713) (← links)
• Function definition in higher-order logic (Q6567726) (← links)
• Transforming optimization problems into disciplined convex programming form (Q6648168) (← links)