The following pages link to (Q4040341):
Displaying 29 items.
- An integrated framework for the diagnosis and correction of rule-based programs (Q604477) (← links)
- Proving semantical equivalence of data specifications (Q678825) (← links)
- Conditional equational theories and complete sets of transformations (Q918541) (← links)
- A hybrid programming scheme combining fuzzy-logic and functional-logic resources (Q1037954) (← links)
- Horn clause programs with polymorphic types: Semantics and resolution (Q1177936) (← links)
- Conditional narrowing modulo a set of equations (Q1261194) (← links)
- Contextual rewriting as a sound and complete proof method for conditional LOG-specifications (Q1323311) (← links)
- Functorial theory of parameterized specifications in a general specification framework (Q1346622) (← links)
- Incremental constraint satisfaction for equational logic programming (Q1367535) (← links)
- Swinging types=functions+relations+transition systems (Q1575635) (← links)
- Observational proofs by rewriting. (Q1607227) (← links)
- Relating CASL with other specification languages: the institution level. (Q1853458) (← links)
- Implicit induction in conditional theories (Q1891255) (← links)
- Reasoning with conditional axioms (Q1924731) (← links)
- Shallow confluence of conditional term rewriting systems (Q2518609) (← links)
- A Debugging Scheme for Functional Logic Programs1 1This work has been partially supported by CICYT under grant TIC2001-2705-C03-01, by Acción Integrada Hispano-Italiana HI2000-0161, Acción Integrada Hispano-Alemana HA2001-0059 and by Generalitat Valenci (Q2841284) (← links)
- Expander2: Program Verification Between Interaction and Automation (Q2873787) (← links)
- An Access Control Language Based on Term Rewriting and Description Logic (Q3003515) (← links)
- Equivalence and difference between institutions: simulating Horn Clause Logic with based algebras (Q4856660) (← links)
- Functional Logic Programming: From Theory to Curry (Q4916076) (← links)
- Completion-time optimization of rewrite-time goal solving (Q5055711) (← links)
- Detecting redundant narrowing derivations by the LSE-SL reducibility test (Q5055750) (← links)
- Logic programs with equational type specifications (Q5096188) (← links)
- Jungle rewriting: An abstract description of a lazy narrowing machine (Q5096278) (← links)
- Mechanizable inductive proofs for a class of ∀ ∃ formulas (Q5210766) (← links)
- Generic induction proofs (Q5881185) (← links)
- An optimal narrowing strategy for general canonical systems (Q5881212) (← links)
- A proof system for conditional algebraic specifications (Q5881266) (← links)
- Knuth-bendix completion of horn clause programs for restricted linear resolution and paramodulation (Q5881277) (← links)
