Parametricity and dependent types
From MaRDI portal
Publication:5176953
DOI10.1145/1863543.1863592zbMath1323.68095OpenAlexW2019626268MaRDI QIDQ5176953
Ross Paterson, Jean-Philippe Bernardy, Patrik Jansson
Publication date: 5 March 2015
Published in: Proceedings of the 15th ACM SIGPLAN international conference on Functional programming (Search for Journal in Brave)
Full work available at URL: https://research.chalmers.se/en/publication/118913
Functional programming and lambda calculus (68N18) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)
Related Items (9)
A unified treatment of syntax with binders ⋮ Unnamed Item ⋮ Internal diagrams and archetypal reasoning in category theory ⋮ Canonicity and normalization for dependent type theory ⋮ Leibniz equality is isomorphic to Martin-Löf identity, parametrically ⋮ A presheaf model of parametric type theory ⋮ Unnamed Item ⋮ A Syntax for Higher Inductive-Inductive Types ⋮ Unnamed Item
This page was built for publication: Parametricity and dependent types
