A rationale for conditional equational programming

DOI10.1016/0304-3975(90)90064-OzbMath0702.68034MaRDI QIDQ915429

Nachum Dershowitz, Mitsuhiro Okada

Publication date: 1990

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

rewriting; logic programming; functional programming; narrowing; conditional equational programming; ground confluence

Mathematics Subject Classification ID

68Q42: Grammars and rewriting systems

68N17: Logic programming

68N01: General topics in the theory of software

Related Items

Term rewriting systems with sort priorities, A new generic scheme for functional logic programming with constraints, Conditional narrowing modulo a set of equations, Completeness results for basic narrowing, Incremental constraint satisfaction for equational logic programming, Abstract data type systems, Automata-driven automated induction, Elimination of conditions, Specification and proof in membership equational logic, Logicality of conditional rewrite systems, Structures for abstract rewriting

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Simplifying conditional term rewriting systems: Unification, termination and confluence
• Note on a proof of the extended Kirby-Paris theorem on labelled finite trees
• Conditional rewrite rules: Confluence and termination
• Computing in systems described by equations
• Proof by semantic attributes of a LISP compiler
• Computing with rewrite systems
• Semantic confluence tests and completion methods
• The relation between logic and functional languages: a survey
• An implementation of narrowing
• Proving termination with multiset orderings
• Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
• Automated Theorem-Proving for Theories with Simplifiers Commutativity, and Associativity
• Completion-time optimization of rewrite-time goal solving
• Intensional interpretations of functionals of finite type I
• Equality, types, modules, and (why not?) generics for logic programming