Logical relations and parametricity - A Reynolds Programme for category theory and programming languages dedicated to the memory of John C. Reynolds, 1935-2013 : in Proceedings of the Workshop on Algebra, Coalgebra and Topology (WACT 2013)
- Submitting institution
-
The University of Birmingham
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 24112993
- Type
- D - Journal article
- DOI
-
10.1016/j.entcs.2014.02.008
- Title of journal
- Electronic Notes in Theoretical Computer Science
- Article number
- -
- First page
- 149
- Volume
- 303
- Issue
- -
- ISSN
- 1571-0661
- Open access status
- Out of scope for open access requirements
- Month of publication
- March
- Year of publication
- 2014
- URL
-
-
- Supplementary information
-
-
- Request cross-referral to
- -
- Output has been delayed by COVID-19
- No
- COVID-19 affected output statement
- -
- Forensic science
- No
- Criminology
- No
- Interdisciplinary
- No
- Number of additional authors
-
2
- Research group(s)
-
-
- Citation count
- 5
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- This paper brings together ideas from a number of areas: "homomorphism" from algebra and category theory, "logical relation" from lambda calculus, "bisimulation" from concurrency, "information hiding" from program synthesis, and "parametricity" from polymorphic calculi. It points out connections hitherto unnoticed and open problems that have so far prevented the formulation of an overarching and unifying theory, and poses challenges to foundational researchers in mathematics and computer science. The paper has had an unusual and unusually broad resonance in these communities, being cited in research on compilation, coalgebra, type theory, logic, certified programming, web programming, verification, and cryptography.
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -