scientific article
From MaRDI portal
Publication:3817590
zbMath0666.68025MaRDI QIDQ3817590
Publication date: 1987
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Abstract data types; algebraic specification (68Q65) Mechanization of proofs and logical operations (03B35) Data structures (68P05)
Related Items
Context rewriting, Extended term rewriting systems, FPL : Functional plus logic programming an integration of the FP and Prolog languages, Relative termination via dependency pairs, Abstract rewriting with concrete operators, Incremental termination proofs and the length of derivations, Time bounded rewrite systems and termination proofs by generalized embedding, Open problems in rewriting, Bi-rewriting, a term rewriting technique for monotonic order relations, Optimal normalization in orthogonal term rewriting systems, Semantics and strong sequentially of priority term rewriting systems, A rewriting approach to binary decision diagrams, Normalization results for typeable rewrite systems, A logic for Miranda, revisited, An incompleteness result in process algebra, Fast Knuth-Bendix completion with a term rewriting system compiler, Semantic types and approximation for Featherweight Java, Proving and rewriting, Hybrid implementations of algebraic specifications, Optimization of rewriting and complexity of rewriting, Jumping and escaping: modular termination and the abstract path ordering, A calculational approach to mathematical induction, Algebraic specification of concurrent systems, Polymorphic rewriting conserves algebraic strong normalization, Rewrite, rewrite, rewrite, rewrite, rewrite, \dots, A criterion for proving noetherianity of a relation, Intersection type assignment systems with higher-order algebraic rewriting, Modularity in noncopying term rewriting, Collapsing partial combinatory algebras, An implementation of syntax directed functional programming on nested- stack machines, Structured operational semantics and bisimulation as a congruence, Termination proofs by multiset path orderings imply primitive recursive derivation lengths, Termination of narrowing via termination of rewriting, Completion for multiple reduction orderings, Termination of Narrowing in Left-Linear Constructor Systems, On pot, pans and pudding or how to discover generalised critical Pairs, Term-rewriting systems with rule priorities, Termination proofs by multiset path orderings imply primitive recursive derivation lengths, A Formalisation of Weak Normalisation (with Respect to Permutations) of Sequent Calculus Proofs, Modular tree transducers
