Approximation of abstract semantics by formal models of programs

DOI10.1515/DMA.1998.8.6.611MaRDI QIDQ4522757zbMATH OpenOpenAlexFDO

Authors Vladimir A. Zakharov

Publication date 16 August 2001

Published in Discrete Mathematics and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1515/dma.1998.8.6.611

zbMATH Keywords

algorithmic systemsfunctional equivalence of programs

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Semantics in the theory of computing (68Q55)

Recommendations

• On the approximability relation for semantics of sequential programs
• scientific article; zbMATH DE number 781170
• Approximability of some program models by others
• scientific article; zbMATH DE number 3858395
• An algebraic approach to semantics of programming languages

Cited in

(8)

• More intensional versions of Rice's theorem
• Denotational models for programming languages: Applications of Banach's fixed point theorem
• Approximability of some program models by others
• Formal models of stepwise refinements of programs
• ZB 2005: Formal Specification and Development in Z and B
• scientific article; zbMATH DE number 3937124 (Why is no real title available?)
• Optimal Abstraction on Real-Valued Programs
• scientific article; zbMATH DE number 194122 (Why is no real title available?)

This page was built for publication: Approximation of abstract semantics by formal models of programs

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