System f-omega with equirecursive types for datatype-generic programming

DOI10.1145/2837614.2837660zbMath1347.68047OpenAlexW2293338131MaRDI QIDQ2828241

Klaus Ostermann, Yufei Cai, Paolo G. Giarrusso

Publication date: 24 October 2016

Published in: Proceedings of the 43rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2837614.2837660

zbMATH Keywords

functorsdatatype-generic programmingequirecursive types

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Combinatory logic and lambda calculus (03B40)

Related Items (2)

Polymorphic higher-order context-free session types ⋮ System \(F^\mu_\omega\) with context-free session types

This page was built for publication: System f-omega with equirecursive types for datatype-generic programming