Programming interfaces and basic topology

DOI10.1016/J.APAL.2005.05.022zbMath1079.68022OpenAlexW2084015889MaRDI QIDQ2575770

Yanyan Li

Publication date: 6 December 2005

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.apal.2005.05.022

zbMATH Keywords

SimulationFormal topologyPredicate transformersConstructive type theory

Mathematics Subject Classification ID

Topological spaces and generalizations (closure spaces, etc.) (54A05) Categorical semantics of formal languages (18C50) Other constructive mathematics (03F65) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (8)

A Minimalist Foundation at Work ⋮ Doo bee doo bee doo ⋮ Indexed containers ⋮ Interactive programming in Agda – Objects and graphical user interfaces ⋮ A linear category of polynomial diagrams ⋮ Interfaces as functors, programs as coalgebras -- a final coalgebra theorem in intensional type theory ⋮ From Proposition to Program ⋮ Unnamed Item

Cites Work

• A single complete rule for data refinement
• The existence of refinement mappings
• Defining liveness
• Inductively generated formal topologies.
• Some points in formal topology.
• The problem of the formalization of constructive topology
• The point of pointless topology
• Proving the Correctness of Multiprocess Programs
• Refinement Calculus
• A semantics of evidence for classical arithmetic
• A set constructor for inductive sets in Martin-Löf's type theory
• Computer Science Logic
• An axiomatic basis for computer programming
• Encoding, decoding and data refinement
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Programming interfaces and basic topology