Pages that link to "Item:Q1322836"
From MaRDI portal
The following pages link to Deductive and inductive synthesis of equational programs (Q1322836):
Displaying 20 items.
- Mechanically certifying formula-based Noetherian induction reasoning (Q507366) (← links)
- An integrated framework for the diagnosis and correction of rule-based programs (Q604477) (← links)
- Programming in equational logic: Beyond strong sequentiality (Q689097) (← links)
- Synthesis of rewrite programs by higher-order and semantic unification (Q749216) (← links)
- A rationale for conditional equational programming (Q915429) (← links)
- Schema induction for logic program synthesis (Q1128483) (← links)
- Equational formulae with membership constraints (Q1333268) (← links)
- Deductive synthesis of sorting programs (Q1822927) (← links)
- Inductive synthesis of recursive processes from logical properties (Q1854392) (← links)
- A theory for deductive synthesis of algorithms in the computing milieu (Q1900220) (← links)
- Middle-out reasoning for synthesis and induction (Q1915136) (← links)
- Programming by predicates: a formal model for interactive synthesis (Q2303879) (← links)
- An approach to automatic deductive synthesis of functional programs (Q2457802) (← links)
- (Q3635984) (← links)
- Canonical Ground Horn Theories (Q4916071) (← links)
- Rewriting techniques for program synthesis (Q5055734) (← links)
- Improving rewriting induction approach for proving ground confluence (Q5111302) (← links)
- Synthesis of induction orderings for existence proofs (Q5210760) (← links)
- Mechanizable inductive proofs for a class of ∀ ∃ formulas (Q5210766) (← links)
- Well-definedness and observational equivalence for inductive–coinductive programs (Q5225850) (← links)