## Axiomatics for Data Refinement in Call By Value Programming Languages

Citations: | 2 - 0 self |

### BibTeX

@MISC{Power_axiomaticsfor,

author = {John Power and Miki Tanaka},

title = {Axiomatics for Data Refinement in Call By Value Programming Languages},

year = {}

}

### OpenURL

### Abstract

We give a systematic category theoretic axiomatics for modelling data refinement in call by value programming languages. Our leading examples of call by value languages are extensions of the computational -calculus, such as FPC and languages for modelling nondeterminism, and extensions of the first order fragment of the computational -calculus, such as a CPS language. We give a category theoretic account of the basic setting, then show how to model contexts, then arbitrary type and term constructors, then signatures, and finally data refinement. This extends and clarifies Kinoshita and Power's work on lax logical relations for call by value languages.