Higher-order UTP for a theory of methods

DOI10.1007/978-3-642-35705-3_10zbMATH Open1452.68061OpenAlexW2217843949MaRDI QIDQ3455652FDOQ3455652

Authors: Frank Zeyda, Ana Cavalcanti 

Publication date: 11 December 2015

Published in: Unifying Theories of Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-35705-3_10

Recommendations

• Object-Orientation in the UTP
• UTP and Sustainability
• A Theory of Pointers for the UTP
• Unifying Theories of Objects
• Mechanical reasoning about families of UTP theories

zbMATH Keywords

consistencysemanticsrecursionobject-orientation

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Semantics in the theory of computing (68Q55)

Cites Work

• Isabelle/HOL. A proof assistant for higher-order logic
• rCOS: a refinement calculus of object systems
• Mechanical reasoning about families of UTP theories
• Unifying Theories in ProofPower-Z
• Mechanising a Unifying Theory
• A Theory of Pointers for the UTP
• Object-Orientation in the UTP
• Predicate transformers and higher-order programs
• The consistency theorem for free type definitions in \(Z\)

Cited In (4)

• Object-Orientation in the UTP
• An Axiomatic Value Model for Isabelle/UTP
• Higher order programming in Java: introspection, subsumption and extraction
• Mechanical Reasoning about Families of UTP Theories

Uses Software

• ProofPower
• Z

This page was built for publication: Higher-order UTP for a theory of methods

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