A hierarchy of mendler style recursion combinators

DOI10.1145/2034773.2034807zbMath1323.68089OpenAlexW2562293731MaRDI QIDQ5176978

T. Sheard, Ki Yung Ahn

Publication date: 5 March 2015

Published in: Proceedings of the 16th ACM SIGPLAN international conference on Functional programming (Search for Journal in Brave)

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

zbMATH Keywords

terminationtotalityhigher-order abstract syntaxparametric polymorphismparametricityrecursion schemescatamorphismhistomorphismrecursion combinators

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18)

Related Items (3)

Classical Logic with Mendler Induction ⋮ Executable Relational Specifications of Polymorphic Type Systems Using Prolog ⋮ Modular Dependent Induction in Coq, Mendler-Style

This page was built for publication: A hierarchy of mendler style recursion combinators