scientific article
From MaRDI portal
Publication:3030249
zbMath0626.68032MaRDI QIDQ3030249
José Meseguer, Joseph A. Goguen
Publication date: 1987
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
operational semanticssemantics of logic programminginstitutionorder-sorted logicmodel-theoretic approachHorn clause logic with equality
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (36)
Compiling concurrent rewriting onto the Rewrite Rule Machine ⋮ Constrained equational deduction ⋮ Automatically Proving and Disproving Feasibility Conditions ⋮ Quasi-Boolean encodings and conditionals in algebraic specification ⋮ A programming language with an expandable grammar ⋮ Order-Sorted Parameterization and Induction ⋮ Category-based modularisation for equational logic programming ⋮ Herbrand theorems in arbitrary institutions ⋮ Automatic synthesis of logical models for order-sorted first-order theories ⋮ Estimating the execution complexity of logical specifications based on context-free grammars ⋮ An introduction to category-based equational logic ⋮ A decade of TAPSOFT ⋮ Algebraic methods in the compositional analysis of logic programs ⋮ Institutions for logic programming ⋮ Specification of abstract dynamic-data types: A temporal logic approach ⋮ Order-sorted model theory for temporal executable specifications ⋮ Equational completion in order-sorted algebras ⋮ A rewrite-based type discipline for a subset of computer algebra ⋮ The 2D dependency pair framework for conditional rewrite systems. II: Advanced processors and implementation techniques ⋮ Specification and proof in membership equational logic ⋮ Soundness and completeness of the Birkhoff equational calculus for many-sorted algebras with possibly empty carrier sets ⋮ Functional Logic Programming in Maude ⋮ Observational structures and their logic ⋮ Order-sorted algebra. I: Equational deduction for multiple inheritance, overloading, exceptions and partial operations ⋮ Multimodal logic programming using equational and order-sorted logic ⋮ Structural induction in institutions ⋮ Order-sorted unification ⋮ Variant-Based Satisfiability in Initial Algebras ⋮ Proving semantic properties as first-order satisfiability ⋮ Using well-founded relations for proving operational termination ⋮ Automatic generation of logical models with AGES ⋮ Equational type logic ⋮ Use of Logical Models for Proving Operational Termination in General Logics ⋮ Semantics of temporal classes ⋮ A hidden Herbrand theorem: Combining the object and logic paradigms ⋮ Narrowing and Rewriting Logic: from Foundations to Applications
This page was built for publication:
