scientific article; zbMATH DE number 4018380

MaRDI QIDQ3030249zbMATH OpenFDO

Authors Joseph Goguen, José Meseguer

Publication date 1987

zbMATH Keywords

operational semanticssemantics of logic programminginstitutionorder-sorted logicmodel-theoretic approachHorn clause logic with equality

Mathematics Subject Classification ID

General topics in the theory of software (68N01) Abstract model theory (03C95) Abstract data types; algebraic specification (68Q65) Properties of classes of models (03C52)

Recommendations

• scientific article; zbMATH DE number 4043302
• A theory of complete logic programs with equality
• scientific article; zbMATH DE number 1984523
• Equality, types, modules, and (why not?) generics for logic programming
• Equality, types, modules, and (why not?) generics for logic programming

Cited in

(46)

• Equational type logic
• A hidden Herbrand theorem: Combining the object and logic paradigms
• scientific article; zbMATH DE number 4102471 (Why is no real title available?)
• Equality, types, modules, and (why not?) generics for logic programming
• Algebraic methods in the compositional analysis of logic programs
• scientific article; zbMATH DE number 18641 (Why is no real title available?)
• Institutions for logic programming
• Order-sorted model theory for temporal executable specifications
• Specification of abstract dynamic-data types: A temporal logic approach
• Automatic generation of logical models with AGES
• Soundness and completeness of the Birkhoff equational calculus for many-sorted algebras with possibly empty carrier sets
• Observational structures and their logic
• Data types in subdefinite models
• Automatically Proving and Disproving Feasibility Conditions
• Structural induction in institutions
• Herbrand theorems in arbitrary institutions
• scientific article; zbMATH DE number 4043302 (Why is no real title available?)
• An introduction to category-based equational logic
• Using well-founded relations for proving operational termination
• Automatic synthesis of logical models for order-sorted first-order theories
• Category-based modularisation for equational logic programming
• A programming language with an expandable grammar
• Order-sorted unification
• Order-sorted algebra. I: Equational deduction for multiple inheritance, overloading, exceptions and partial operations
• Semantics of temporal classes
• Multimodal logic programming using equational and order-sorted logic
• Equality, types, modules, and (why not?) generics for logic programming
• Unification modulo an equality theory for equational logic programming
• Narrowing and rewriting logic: from foundations to applications
• Quasi-Boolean encodings and conditionals in algebraic specification
• Specification and proof in membership equational logic
• Use of logical models for proving operational termination in general logics
• The 2D dependency pair framework for conditional rewrite systems. II: Advanced processors and implementation techniques
• Model reconciliation in logic programs
• Functional logic programming in Maude
• Hyperequivalence of logic programs with respect to supported models
• Compiling concurrent rewriting onto the Rewrite Rule Machine
• Equational completion in order-sorted algebras
• Proving semantic properties as first-order satisfiability
• Order-Sorted Parameterization and Induction
• Top-down semantics of fair computations of logic programs
• Variant-Based Satisfiability in Initial Algebras
• A rewrite-based type discipline for a subset of computer algebra
• Estimating the execution complexity of logical specifications based on context-free grammars
• Constrained equational deduction
• A decade of TAPSOFT. Aspects of progress and prospects in theory and practice of software development

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3030249)