scientific article; zbMATH DE number 4060701

MaRDI QIDQ3795207zbMATH OpenFDO

Authors Claude Kirchner, Hélène Kirchner, José Meseguer

Publication date 1988

zbMATH Keywords

equational order-sorted rewritinglogical programming language OBJoperational semanticsorder-sorted algebras

Mathematics Subject Classification ID

Equational logic, Mal'tsev conditions (08B05) Specification and verification (program logics, model checking, etc.) (68Q60) Abstract data types; algebraic specification (68Q65)

Recommendations

• scientific article; zbMATH DE number 4090765
• scientific article; zbMATH DE number 3949706
• Programming with equalities, subsorts, overloading, and parametrization in OBJ
• Semantics of order-sorted specifications
• A semantic approach to order-sorted rewriting

Cited in

(27)

• Order-sorted completion: The many-sorted way
• Semantics of order-sorted specifications
• Conditional rewriting logic as a unified model of concurrency
• Order-sorted algebra. I: Equational deduction for multiple inheritance, overloading, exceptions and partial operations
• Schematization of infinite sets of rewrite rules generated by divergent completion processes
• Another look at parameterization for oder-sorted algebraic specifications
• Formalizing mathematics in higher-order logic: A case study in geometric modelling
• On the Church-Rosser and coherence properties of conditional order-sorted rewrite theories
• Specification and proof in membership equational logic
• A complete semantics of \(\mathbb{K}\) and its translation to Isabelle
• Order-Sorted Rewriting and Congruence Closure
• José Meseguer: scientist and friend extraordinaire
• Weak bisimulation as a congruence in MSOS
• Order-Sorted Parameterization and Induction
• Termination Modulo Combinations of Equational Theories
• scientific article; zbMATH DE number 4090765 (Why is no real title available?)
• Programming with equalities, subsorts, overloading, and parametrization in OBJ
• R n - and G n -logics
• Inductive proofs by specification transformations
• Proving and rewriting
• Operational termination of membership equational programs: the order-sorted way
• Completion of rewrite systems with membership constraints
• Order-sorted unification
• Completeness and confluence of order-sorted term rewriting
• Conditional rewriting logic: Deduction, models and concurrency
• Strict coherence of conditional rewriting modulo axioms
• Equational completion in order-sorted algebras

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 Q3795207)