scientific article
From MaRDI portal
Publication:3703312
zbMath0581.68064MaRDI QIDQ3703312
Publication date: 1985
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
algorithmfunctional logic programmingcomplete unification procedure for confluent conditional term rewriting systemsRAP systemrapid prototyping for algebraic specifications
Symbolic computation and algebraic computation (68W30) General topics in the theory of software (68N01)
Related Items
Conditional rewriting logic: Deduction, models and concurrency, Structured algebraic specifications: A kernel language, Behavioural approaches to algebraic specifications. A comparative study, Completion-time optimization of rewrite-time goal solving, Negation with logical variables in conditional rewriting, Simplifying conditional term rewriting systems: Unification, termination and confluence, A class of confluent term rewriting systems and unification, Kernel-LEAF: A logic plus functional language, Equational specification of partial higher-order algebras, History and basic features of the critical-pair/completion procedure, Incremental constraint satisfaction for equational logic programming, On completeness of narrowing strategies, Conditional equational theories and complete sets of transformations, The calculus of context relations, Conditional narrowing modulo a set of equations, Complete sets of transformations for general E-unification, A completion procedure for conditional equations, Horn equational theories and paramodulation, Basic narrowing revisited, Unification in permutative equational theories is undecidable, Higher order unification via explicit substitutions
