Computational lambda-calculus and monads
Proceedings of the Fourth Annual Symposium on Logic in computer science
Correctness of data representations in Algol-like languages
A classical mind
Foundations of programming languages
Foundations of programming languages
A representable approach to finite nondeterminism
MFPS '94 Proceedings of the tenth conference on Mathematical foundations of programming semantics
Data refinement and algebraic structure
Acta Informatica
Premonoidal categories as categories with algebraic structure
Theoretical Computer Science
Types, Abstractions, and Parametric Polymorphism, Part 2
Proceedings of the 7th International Conference on Mathematical Foundations of Programming Semantics
Environments, Continuation Semantics and Indexed Categories
TACS '97 Proceedings of the Third International Symposium on Theoretical Aspects of Computer Software
An Axiomatic Approach to Binary Logical Relations with Applications to Data Refinement
TACS '97 Proceedings of the Third International Symposium on Theoretical Aspects of Computer Software
A General Completeness Result in Refinement
WADT '99 Selected papers from the 14th International Workshop on Recent Trends in Algebraic Development Techniques
Categories with Algebraic Structure
CSL '97 Selected Papers from the11th International Workshop on Computer Science Logic
An Axiomatics for Categories of Transition Systems as Coalgebras
LICS '98 Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science
Premonoidal categories and notions of computation
Mathematical Structures in Computer Science
Generic models for computational effects
Theoretical Computer Science - Logic, language, information and computation
| Hi-index | 0.00 |
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 @l-calculus, such as FPC and languages for modelling nondeterminism, and extensions of the first order fragment of the computational @l-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.