Dynamically-typed computations for order-sorted equational presentations

DOI10.1007/3-540-58201-0_89zbMath1418.68057OpenAlexW1542420363MaRDI QIDQ4632447

Claus Hintermeier, Hélène Kirchner, Claude Kirchner

Publication date: 29 April 2019

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://hal.inria.fr/inria-00074463/file/RR-2208.pdf

zbMATH Keywords

tree automatoncritical pairalgebraic frameworkvariable declarationcompletion process

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Logic in computer science (03B70) Abstract data types; algebraic specification (68Q65) Grammars and rewriting systems (68Q42) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items

Higher order unification via explicit substitutions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Equational type logic
• Investigations in many-sorted quantor logic
• Equational completion in order-sorted algebras
• Order-sorted completion: The many-sorted way
• Semantics of order-sorted specifications
• Order-sorted algebra. I: Equational deduction for multiple inheritance, overloading, exceptions and partial operations
• Completion of rewrite systems with membership constraints. II: Constraint solving
• Dynamically typed computations for order-sorted equational presentations
• Computational aspects of an order-sorted logic with term declarations
• Programming with equalities, subsorts, overloading, and parametrization in OBJ
• A semantic approach to order-sorted rewriting
• Algebraic semantics of rewriting terms and types
• Completeness and confluence of order-sorted term rewriting