Override and update

07/19/2019
by   Marel Jackson, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/18/2019

Extending partial automorphisms of n-partite tournaments

We prove that for every n≥ 2 the class of all finite n-partite tournamen...
research
04/10/2019

Asymptotic combinatorial constructions of Geometries

An approach to asymptotic finite approximations of geometrical spaces is...
research
12/25/2022

Bivariate functions with low c-differential uniformity

Starting with the multiplication of elements in 𝔽_q^2 which is consisten...
research
04/10/2019

Combinatorial constructions of intrinsic geometries

A generic method for combinatorial constructions of intrinsic geometrica...
research
11/30/2020

Difference-restriction algebras of partial functions: axiomatisations and representations

We investigate the representation and complete representation classes fo...
research
01/24/2022

Valid belief updates for prequentially additive loss functions arising in Semi-Modular Inference

Model-based Bayesian evidence combination leads to models with multiple ...

Please sign up or login with your details

Forgot password? Click here to reset