Higher-Order UTP for a Theory of Methods

DOI10.1007/978-3-642-35705-3_10zbMath1452.68061OpenAlexW2217843949MaRDI QIDQ3455652

Ana Cavalcanti, Frank Zeyda

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

zbMATH Keywords

consistencyrecursionsemanticsobject-orientation

Mathematics Subject Classification ID

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

Related Items (1)

An Axiomatic Value Model for Isabelle/UTP

Uses Software

• ProofPower
• Z

Cites Work

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

This page was built for publication: Higher-Order UTP for a Theory of Methods