Power, J. and Tanaka, M., 2009. Axiomatics for Data Refinement in Call by Value Programming Languages. Electronic Notes in Theoretical Computer Science, 225, pp. 281-302.
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.
|Item Type ||Articles|
|Creators||Power, J.and Tanaka, M.|
|Departments||Faculty of Science > Computer Science|
|Publisher Statement||Power_ENTCS_2009_225_281.pdf: NOTICE: this is the author’s version of a work that was accepted for publication in Electronic Notes in Theoretical Computer Science. Changes resulting from the publishing process, such as peer review, editing, corrections, structural formatting, and other quality control mechanisms may not be reflected in this document. Changes may have been made to this work since it was submitted for publication. A definitive version was subsequently published in Electronic Notes in Theoretical Computer Science, 225, 2009, DOI 10.1016/j.entcs.2008.12.081|
|Additional Information||ID number: doi:10.1016/j.entcs.2008.12.081|
Actions (login required)