A computational interpretation of parametricity

DOI10.1109/LICS.2012.25MaRDI QIDQ2986790zbMATH OpenOpenAlexFDO

Authors Jean-Philippe Bernardy, Guilhem Moulin

Publication date 16 May 2017

Published in 2012 27th Annual IEEE Symposium on Logic in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/lics.2012.25

zbMATH Keywords

lambda calculustype structure

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40)

Recommendations

• Parametricity and dependent types
• Proofs for free. Parametricity for dependent types
• Parametricity in an impredicative sort
• Internalizing relational parametricity in the extensional calculus of constructions
• A presheaf model of parametric type theory

Cited in

(13)

• Proofs for free. Parametricity for dependent types
• Internalizing relational parametricity in the extensional calculus of constructions
• Relational Parametricity for Computational Effects
• Parametricity, type equality, and higher-order polymorphism
• Towards a cubical type theory without an interval
• Parametricity in an impredicative sort
• Internal parametricity for cubical type theory
• Parametricity and dependent types
• Modules, abstraction, and parametric polymorphism
• A presheaf model of parametric type theory
• Displayed type theory and semi-simplicial types
• A parametricity-based formalization of semi-simplicial and semi-cubical sets
• Extending equational monadic reasoning with monad transformers

This page was built for publication: A computational interpretation of parametricity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2986790)