• Home
  • Features
  • Pricing
  • Docs
  • Announcements
  • Sign In

steve-downey / compile-time-scheme / 28564470244

02 Jul 2026 04:02AM UTC coverage: 88.906% (+0.6%) from 88.326%
28564470244

push

github

steve-downey
implement real mendler_fold and mendler_para combinators

Replace the hand-rolled recursive dispatch in mendler_run with a genuine
Mendler-style paramorphism. The interpreter logic is now an algebra passed
to the generic mendler_para combinator, receiving an opaque recurse function
rather than calling itself by name.

Add mendler_fold (Mendler catamorphism with context) and mendler_para
(Mendler paramorphism with context) to recursion_schemes.hpp. Both are
constexpr and generic over any Fix<F> type.

Update all blog posts and reference documentation to reflect the new
combinator-based architecture.

Co-Authored-By: Claude Opus 4.6 (1M context) <noreply@anthropic.com>

121 of 149 new or added lines in 3 files covered. (81.21%)

2901 of 3263 relevant lines covered (88.91%)

62.17 hits per line

Source File
Press 'n' to go to next uncovered line, 'b' for previous

98.37
/src/smd/fixpoint/recursion_schemes.t.cpp


Source Not Available

STATUS · Troubleshooting · Open an Issue · Sales · Support · CAREERS · ENTERPRISE · START FREE · SCHEDULE DEMO
ANNOUNCEMENTS · TWITTER · TOS & SLA · Supported CI Services · What's a CI service? · Automated Testing

© 2026 Coveralls, Inc