scientific article
From MaRDI portal
Publication:4040912
zbMath0702.68018MaRDI QIDQ4040912
Publication date: 5 June 1993
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
program transformationprogram correctnessprogram equivalenceDenotational semanticsfully abstract modelsleast fixed point models
Theory of programming languages (68N15) Semantics in the theory of computing (68Q55) Specification and verification (program logics, model checking, etc.) (68Q60) Research exposition (monographs, survey articles) pertaining to computer science (68-02)
Related Items (17)
Equationally fully abstract models of PCF ⋮ Sequential functions on indexed domains and full abstraction for a sub-language of PCF ⋮ Types and full abstraction for polyadic \(\pi\)-calculus ⋮ Concurrent testing of processes ⋮ A blocking model for reactive objects ⋮ A uniform approach to completions of posets ⋮ From operational to denotational semantics ⋮ Continuous functions and parallel algorithms on concrete data structures ⋮ On a higher-order calculus of computational fields ⋮ Semantical analysis of specification logic ⋮ A Higher-Order Calculus of Computational Fields ⋮ A direct characterization of completion ⋮ On dynamically generated ontology translators in agent communication ⋮ A categorical foundation for structured reversible flowchart languages: Soundness and adequacy ⋮ The semantics of the combination of atomized statements and parallel choice ⋮ On abstraction and the expressive power of programming languages ⋮ Full abstraction for PCF
This page was built for publication:
