Programming from Galois connections
From MaRDI portal
Publication:1931902
DOI10.1016/j.jlap.2012.05.003zbMath1257.68057OpenAlexW2180807186MaRDI QIDQ1931902
José Nuno Oliveira, Shin-Cheng Mu
Publication date: 16 January 2013
Published in: The Journal of Logic and Algebraic Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jlap.2012.05.003
Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Galois correspondences, closure operators (in relation to ordered sets) (06A15) Categories of spans/cospans, relations, or partial maps (18B10)
Related Items (7)
Formal derivation of greedy algorithms from relational specifications: a tutorial ⋮ Kernels, in a nutshell ⋮ Continuity as a computational effect ⋮ Programming from metaphorisms ⋮ On the construction of adjunctions between a fuzzy preposet and an unstructured set ⋮ On the definition of suitable orderings to generate adjunctions over an unstructured codomain ⋮ Generating Isotone Galois Connections on an Unstructured Codomain
Uses Software
Cites Work
- Products in categories of relations
- Algebras for Galois-style connections and their discrete duality
- A calculational approach to mathematical induction
- Safety of abstract interpretations for free, via logical relations and Galois connections
- An Optimal Algorithm for the Maximum-Density Segment Problem
- Programming as a Discipline of Mathematical Nature
- Generic functional programming with types and relations
- Extended Static Checking by Calculation Using the Pointfree Transform
- Homomorphism and Isomorphism Theorems Generalized from a Relational Perspective
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Programming from Galois connections