Logical Relations and Galois Connections

Authors:
Kevin Backhouse;Roland Backhouse
Affiliations:
-;-
Venue:
MPC '02 Proceedings of the 6th International Conference on Mathematics of Program Construction
Year:
2002

Citing 7
Cited 0

Theorems for free!

FPCA '89 Proceedings of the fourth international conference on Functional programming languages and computer architecture
Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints

POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Principles of Program Analysis

Principles of Program Analysis
Systematic design of program analysis frameworks

POPL '79 Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Polynomial Relators (Extended Abstract)

AMAST '91 Proceedings of the Second International Conference on Methodology and Software Technology: Algebraic Methodology and Software Technology
A Functional Semantics of Attribute Grammars

TACAS '02 Proceedings of the 8th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Algebraic structure theory of sequential machines (Prentice-Hall international series in applied mathematics)

Algebraic structure theory of sequential machines (Prentice-Hall international series in applied mathematics)

Quantified Score

Hi-index	0.01

Visualization

Abstract

Algebraic properties of logical relations on partially ordered sets are studied. It is shown how to construct a logical relation that extends a collection of base Galois connections to a Galois connection of arbitrary higher-order type. "Theorems-for-free" is used to show that the construction ensures safe abstract interpretation of parametrically polymorphic functions.