Transfinite semantics in the form of greatest fixpoint

DOI10.1016/j.jlap.2009.03.001zbMath1186.68269OpenAlexW1997489695MaRDI QIDQ843215

Härmel Nestra

Publication date: 29 September 2009

Published in: The Journal of Logic and Algebraic Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jlap.2009.03.001

zbMATH Keywords

fractional semanticsgreatest fixpointtransfinite semanticstree semantics

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Theory of software (68N99)

Related Items (2)

Trace-Based Coinductive Operational Semantics for While ⋮ Cut branches before looking for bugs: certifiably sound verification on relaxed slices

Cites Work

• Unnamed Item
• Semantics with applications: an appetizer.
• Coinductive big-step operational semantics
• Non-standard semantics for program slicing
• Constructive design of a hierarchy of semantics of a transition system by abstract interpretation
• Transfinite reductions in orthogonal term rewriting systems
• Fractional Semantics
• Programming Languages and Systems

This page was built for publication: Transfinite semantics in the form of greatest fixpoint