Equivalence of formal semantics definition methods

DOI10.1007/BF01212525zbMATH Open0868.68075OpenAlexW1975908952MaRDI QIDQ1355752FDOQ1355752

Authors: M. J. A. Caswell 

Publication date: 28 May 1997

Published in: Formal Aspects of Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01212525

Recommendations

• The equivalence of two semantic definitions for inheritance in object-oriented languages
• Operational and semantic equivalence between recursive programs.
• When are different type-logical semantic definitions defining equivalent meanings?
• Fuzzy semantics of programming languages
• On the semantic equivalence of language syntax formalisms

zbMATH Keywords

denotational semanticsstructural operational semanticsaction semantics

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Proving Properties of Programs by Structural Induction
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Consistent and complementary formal theories of the semantics of programming languages
• Title not available (Why is that?)

Cited In (5)

• When are different type-logical semantic definitions defining equivalent meanings?
• A decision procedure for semantical equivalence of thin FM specifications
• Equivalence Checking of Non-deterministic Operations
• The equivalence of two semantic definitions for inheritance in object-oriented languages
• Proving semantical equivalence of data specifications

This page was built for publication: Equivalence of formal semantics definition methods

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