Transfinite corecursion

MaRDI QIDQ3370737zbMATH OpenFDO

Authors Härmel Nestra

Publication date 8 February 2006

zbMATH Keywords

program slicingtransfinite semantics

Mathematics Subject Classification ID

Theory of programming languages (68N15) Semantics in the theory of computing (68Q55)

Recommendations

• Transfinite semantics in the form of greatest fixpoint
• Fractional Semantics
• Iteratively defined transfinite trace semantics and program slicing with respect to them
• On the Foundations of Corecursion
• scientific article; zbMATH DE number 1722708

Cited in

(10)

• Non-standard semantics for program slicing
• The computational contents of ramified corecurrence
• Fractional Semantics
• Hyperfinite transversal theory. II
• Iterability for (transfinite) stacks
• Iteratively defined transfinite trace semantics and program slicing with respect to them
• V→M: A Virtual Machine for Strict Evaluation of (Co)Recursive Functions
• Parametric corecursion
• Transfinite semantics in the form of greatest fixpoint
• A trajectory-based strict semantics for program slicing

This page was built for publication: Transfinite corecursion

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