Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by
Crossref.
ALTENKIRCH, THORSTEN
GHANI, NEIL
HANCOCK, PETER
MCBRIDE, CONOR
and
MORRIS, PETER
2015.
Indexed containers.
Journal of Functional Programming,
Vol. 25,
Issue. ,
Ahman, Danel
and
Uustalu, Tarmo
2016.
Directed Containers as Categories.
Electronic Proceedings in Theoretical Computer Science,
Vol. 207,
Issue. ,
p.
89.
Miraldo, Victor Cacciari
and
Serrano, Alejandro
2018.
Sums of products for mutually recursive datatypes: the appropriationist’s view on generic programming.
p.
65.
Danielsson, Nils Anders
2018.
Up-to techniques using sized types.
Proceedings of the ACM on Programming Languages,
Vol. 2,
Issue. POPL,
p.
1.
Tomé Cortiñas, Carlos
and
Swierstra, Wouter
2018.
From algebra to abstract machine: a verified generic construction.
p.
78.
Balestrieri, Florent
and
Mauny, Michel
2018.
Generic Programming in OCaml.
Electronic Proceedings in Theoretical Computer Science,
Vol. 285,
Issue. ,
p.
59.
Kraus, Nicolai
and
von Raumer, Jakob
2019.
Path Spaces of Higher Inductive Types in Homotopy Type Theory.
p.
1.
Hugunin, Jasper
2019.
Foundations of Software Science and Computation Structures.
Vol. 11425,
Issue. ,
p.
295.
Blanchette, Jasmin Christian
Gheri, Lorenzo
Popescu, Andrei
and
Traytel, Dmitriy
2019.
Bindings as bounded natural functors.
Proceedings of the ACM on Programming Languages,
Vol. 3,
Issue. POPL,
p.
1.
Rahli, Vincent
Bickford, Mark
Cohen, Liron
and
Constable, Robert L.
2019.
Bar Induction is Compatible with Constructive Type Theory.
Journal of the ACM,
Vol. 66,
Issue. 2,
p.
1.
Gheri, Lorenzo
and
Popescu, Andrei
2020.
A Formalized General Theory of Syntax with Bindings: Extended Version.
Journal of Automated Reasoning,
Vol. 64,
Issue. 4,
p.
641.
Sattler, Christian
and
Vezzosi, Andrea
2020.
Partial Univalence in n-truncated Type Theory.
p.
807.
Johann, Patricia
and
Polonsky, Andrew
2020.
Foundations of Software Science and Computation Structures.
Vol. 12077,
Issue. ,
p.
339.
ALLAIS, GUILLAUME
ATKEY, ROBERT
CHAPMAN, JAMES
MCBRIDE, CONOR
and
MCKINNA, JAMES
2021.
A type- and scope-safe universe of syntaxes with binding: their semantics and proofs.
Journal of Functional Programming,
Vol. 31,
Issue. ,
Finster, Eric
Allioux, Antoine
and
Sozeau, Matthieu
2021.
Types Are Internal ∞-Groupoids.
p.
1.
Finster, Eric
Mimram, Samuel
Lucas, Maxime
and
Seiller, Thomas
2021.
A Cartesian Bicategory of Polynomial Functors in Homotopy Type Theory.
Electronic Proceedings in Theoretical Computer Science,
Vol. 351,
Issue. ,
p.
67.
Johann, Patricia
Ghiorzi, Enrico
and
Jeffries, Daniel
2022.
GADTs, Functoriality, Parametricity: Pick Two.
Electronic Proceedings in Theoretical Computer Science,
Vol. 357,
Issue. ,
p.
77.
Hewer, Brandon
and
Hutton, Graham
2022.
Mathematics of Program Construction.
Vol. 13544,
Issue. ,
p.
34.
Maillard, Kenji
Lennon-Bertrand, Meven
Tabareau, Nicolas
and
Tanter, Éric
2022.
A reasonably gradual type theory.
Proceedings of the ACM on Programming Languages,
Vol. 6,
Issue. ICFP,
p.
931.
Hou (Favonia), Kuen-Bang
and
Wang, Zhuyang
2022.
Logarithm and program testing.
Proceedings of the ACM on Programming Languages,
Vol. 6,
Issue. POPL,
p.
1.
Discussions
No Discussions have been published for this article.