Equational Formulas and Pattern Operations in Initial Order-Sorted Algebras

DOI10.1007/978-3-319-27436-2_3zbMath1362.68053OpenAlexW2296529720MaRDI QIDQ5743584

José Meseguer, Stephen Skeirik

Publication date: 5 February 2016

Published in: Logic-Based Program Synthesis and Transformation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-27436-2_3

zbMATH Keywords

order-sorted logicinitial decidabilitypattern operations

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Theory of programming languages (68N15) Logic in computer science (03B70) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (3)

Equational formulas and pattern operations in initial order-sorted algebras ⋮ Automatic synthesis of logical models for order-sorted first-order theories ⋮ Variant-Based Satisfiability in Initial Algebras

Uses Software

• OBJ3
• CafeOBJ
• Maude

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Order-sorted unification
• All about Maude -- a high-performance logical framework. How to specify, program and verify systems in rewriting logic. With CD-ROM.
• Explicit representation of terms defined by counter examples
• Equational problems and disunification
• Order-sorted algebra. I: Equational deduction for multiple inheritance, overloading, exceptions and partial operations
• Negation elimination in empty or permutative theories
• Equational formulae with membership constraints
• Explicit versus implicit representations of subsets of the Herbrand universe.
• Equational formulas and pattern operations in initial order-sorted algebras
• Institutions: abstract model theory for specification and programming

This page was built for publication: Equational Formulas and Pattern Operations in Initial Order-Sorted Algebras