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
AbstractThe “semantics of flow diagrams” are used to motivate the notion of partially additive monoi...
We employ the notions of ‘sequential function’ and ‘interrogation’ (dialogue) in order to define new...
We exhibit an adjunction between a category of abstract algebras of partial functions and a category...
Override and update are natural constructions for combining partial functions, which arise in variou...
There are only very few natural ways in which arbitrary functions can be combined. One composition o...
We study the algebraic theory of computable functions, which can be viewed as arising from possibly ...
We give complete, finite quasiequational axiomatisations for algebras of unary partial functions und...
We define antidomain operations for algebras of multiplace partial functions. For all signatures con...
AbstractPartial functions are the most suitable characterization of program effects. Formal reasonin...
This thesis collects together four sets of results, produced by investigating modifications, in four...
AbstractA datastructure instance, e.g. a set or file or record, may be modified independently by dif...
AbstractSuppose P(x, y) is a program with two arguments, whose first argument has a known value c, b...
In this paper we present an abstract representation of pointer structures in Kleene algebras and the...
We investigate the representation and complete representation classes for algebras of partial functi...
AbstractThe “semantics of flow diagrams” are used to motivate the notion of partially additive monoi...
We employ the notions of ‘sequential function’ and ‘interrogation’ (dialogue) in order to define new...
We exhibit an adjunction between a category of abstract algebras of partial functions and a category...
Override and update are natural constructions for combining partial functions, which arise in variou...
There are only very few natural ways in which arbitrary functions can be combined. One composition o...
We study the algebraic theory of computable functions, which can be viewed as arising from possibly ...
We give complete, finite quasiequational axiomatisations for algebras of unary partial functions und...
We define antidomain operations for algebras of multiplace partial functions. For all signatures con...
AbstractPartial functions are the most suitable characterization of program effects. Formal reasonin...
This thesis collects together four sets of results, produced by investigating modifications, in four...
AbstractA datastructure instance, e.g. a set or file or record, may be modified independently by dif...
AbstractSuppose P(x, y) is a program with two arguments, whose first argument has a known value c, b...
In this paper we present an abstract representation of pointer structures in Kleene algebras and the...
We investigate the representation and complete representation classes for algebras of partial functi...
AbstractThe “semantics of flow diagrams” are used to motivate the notion of partially additive monoi...
We employ the notions of ‘sequential function’ and ‘interrogation’ (dialogue) in order to define new...
We exhibit an adjunction between a category of abstract algebras of partial functions and a category...
DOI
Add to ORKG