-Calculus with Explicit Points and Approximations

DOI10.1093/LOGCOM/12.2.255MaRDI QIDQ4542238zbMATH OpenOpenAlexFDO

Authors Mads Dam, Dilian Gurov

Publication date 1 August 2002

Published in Journal Of Logic And Computation (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/3b0df0bf432686704cce361ab4984320a5a1e216

zbMATH Keywords

\(\mu\)-calculuscompositionalityfixed-point formulasprogram verificationsequent calculus

Mathematics Subject Classification ID

Logic in computer science (03B70) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• Rudiments of \(\mu\)-calculus
• The approximation theorem for the \(\Lambda_{\mu}\)-calculus
• Łukasiewicz \(\mu\)-calculus
• scientific article; zbMATH DE number 7357543
• The differential \(\lambda \mu\)-calculus
• P 2 (μ) and Bounded Point Evaluations
• scientific article; zbMATH DE number 2113684
• scientific article; zbMATH DE number 5051663
• The \(\lambda \mu^{\mathbf{T}}\)-calculus
• scientific article; zbMATH DE number 3995637

Cited in

(11)

• Sequent calculi for process verification: Hennessy-Milner logic for an arbitrary GSOS
• Reducing behavioural to structural properties of programs with procedures
• On global induction mechanisms in aμ-calculus with explicit approximations
• scientific article; zbMATH DE number 2087443 (Why is no real title available?)
• scientific article; zbMATH DE number 7357543 (Why is no real title available?)
• Fragments of arithmetic and cyclic proofs
• Proof systems for two-way modal -calculus
• Trace-based deductive verification
• Computation by infinite descent made explicit
• Cyclic proofs in Hoare logic and its reverse
• Canonical completeness of infinitary \(\mu \)

This page was built for publication: -Calculus with Explicit Points and Approximations

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