Unifying structured recursion schemes
From MaRDI portal
Publication:5244801
DOI10.1145/2500365.2500578zbMath1323.68123OpenAlexW2135326783MaRDI QIDQ5244801
Jeremy Gibbons, Ralf Hinze, Nicolas Wu
Publication date: 30 March 2015
Published in: Proceedings of the 18th ACM SIGPLAN international conference on Functional programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/2500365.2500578
Functional programming and lambda calculus (68N18) Semantics in the theory of computing (68Q55) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)
Related Items (5)
Verifying Catamorphism-Based Contracts using Constrained Horn Clauses ⋮ Folding over neural networks ⋮ Classical (co)recursion: Mechanics ⋮ Fantastic morphisms and where to find them. A guide to recursion schemes ⋮ Unifying structured recursion schemes
This page was built for publication: Unifying structured recursion schemes
