Dynamically typed computations for order-sorted equational presentations

DOI10.1006/JSCO.1997.0187MaRDI QIDQ1264443zbMATH OpenOpenAlexFDO

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

Publication date 27 June 2000

Published in Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/32f3afa6bcb7c13174cf222f0d65709a868a89d7

zbMATH Keywords

\(G\)-algebraoperational semantics

Mathematics Subject Classification ID

Logic in computer science (03B70) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Grammars and rewriting systems (68Q42) Semantics in the theory of computing (68Q55) Abstract data types; algebraic specification (68Q65)

Recommendations

• Dynamically-typed computations for order-sorted equational presentations
• scientific article; zbMATH DE number 3949706
• Order-sorted algebra. I: Equational deduction for multiple inheritance, overloading, exceptions and partial operations
• Equational formulas and pattern operations in initial order-sorted algebras

Cited in

(3)

• Specification and proof in membership equational logic
• Dynamically-typed computations for order-sorted equational presentations
• R n - and G n -logics

This page was built for publication: Dynamically typed computations for order-sorted equational presentations

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