Logical relations, data abstraction, and structured fibrations

Authors:
John Power;Edmund Robinson
Affiliations:
Laboratory for the Foundations of Computer Science, University of Edinburgh, King's Buildings, Edinburgh EH9 3JZ, Scotland;Department of Computer Science, Queen Mary and Westfield College, Mile End Road, London, E1 4NS, England
Venue:
Proceedings of the 2nd ACM SIGPLAN international conference on Principles and practice of declarative programming
Year:
2000

Computational lambda-calculus and monads

Proceedings of the Fourth Annual Symposium on Logic in computer science
Type systems for programming languages

Handbook of theoretical computer science (vol. B)
Correctness of data representations in Algol-like languages

A classical mind
A characterization of lambda definability in categorical models of implicit polymorphism

Theoretical Computer Science
Foundations of programming languages

Foundations of programming languages
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
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 New Characterization of Lambda Definability

TLCA '93 Proceedings of the International Conference on Typed Lambda Calculi and Applications
Premonoidal categories and notions of computation

Mathematical Structures in Computer Science

Hi-index	0.00