Introduction to higher order categorical logic
Introduction to higher order categorical logic
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
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
CSL '99 Proceedings of the 13th International Workshop and 8th Annual Conference of the EACSL 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
Logic for computational effects: work in progress
IWFM'03 Proceedings of the 6th international conference on Formal Methods
| Hi-index | 0.00 |
We give a category theoretic framework for data-refinement in call-by-value programming languages. One approach to data refinement for the simply typed λ-calculus is given by generalising the notion of logical relation to one of lax logical relation, so that binary lax logical relations compose. So here, we generalise the notion of lax logical relation, defined in category theoretic terms, from the simply typed λ-calculus to the computational λ-calculus as a model of data refinement.