Override and update
Logic
2021-01-05 v2 Logic in Computer Science
Abstract
Override and update are natural constructions for combining partial functions, which arise in various program specification contexts. We use an unexpected connection with combinatorial geometry to provide a complete finite system of equational axioms for the first order theory of the override and update constructions on partial functions, resolving the main unsolved problem in the area.
Keywords
Cite
@article{arxiv.1907.08336,
title = {Override and update},
author = {Marcel Jackson and Tim Stokes},
journal= {arXiv preprint arXiv:1907.08336},
year = {2021}
}