The following pages link to (Q3490989):
Displaying 20 items.
- An experimental logic based on the fundamental deduction principle (Q580998) (← links)
- The expressiveness of a family of finite set languages (Q672126) (← links)
- Rippling: A heuristic for guiding inductive proofs (Q685548) (← links)
- Meta-circular interpreter for a strongly typed language (Q908683) (← links)
- On observational equivalence and algebraic specification (Q1089796) (← links)
- Prolegomena to a theory of mechanized formal reasoning (Q1140436) (← links)
- Inferring the equivalence of functional programs that mutate data (Q1196301) (← links)
- Synthesis of ML programs in the system Coq (Q1322847) (← links)
- Proving Ramsey's theory by the cover set induction: A case and comparision study. (Q1353938) (← links)
- Program tactics and logic tactics (Q1380427) (← links)
- A rewriting approach to satisfiability procedures. (Q1401930) (← links)
- The automated proof of a trace transformation for a bitonic sort (Q1822503) (← links)
- Automata-driven automated induction (Q1854445) (← links)
- Sound generalizations in mathematical induction (Q1882908) (← links)
- First-order automated reasoning with theories: when deduction modulo theory meets practice (Q2209546) (← links)
- A framework for the verification of certifying computations (Q2351144) (← links)
- A taxonomy of exact methods for partial Max-SAT (Q2434567) (← links)
- E-generalization using grammars (Q2457667) (← links)
- Shallow confluence of conditional term rewriting systems (Q2518609) (← links)
- A metatheory of a mechanized object theory (Q2676562) (← links)
