kont v0.1.2 — Pool-based frame reuse

[hayabusa-cloud]

Introduction

The kont package implements delimited continuations and algebraic effects for Go, targeting version 1.26+. It provides two computation representations: Cont[R, A] (closure-based CPS type) and Expr[A] (defunctionalized representation using an iterative trampoline).

Key Additions

This version reduces per-evaluation heap allocations in the Expr evaluator:

• sync.Pool-backed acquire/release for EffectFrame, BindFrame, ThenFrame, and internal chainedFrame nodes
• Suspension reuse across Resume calls, saving one allocation per step
• Named identity continuations (identity[A], identityResume) replacing anonymous closures with static function values

Usage

Downstream packages that guarantee affine (single-use) evaluation can acquire pooled frames instead of heap-allocating:

ef := kont.AcquireEffectFrame()
ef.Operation = Get[int]{}
ef.Resume = func(v any) any { return v }
ef.Next = kont.ReturnFrame{}
expr := kont.ExprSuspend[int](ef)
// the evaluator releases the frame after consumption
result := kont.HandleExpr(expr, handler)

What's Changed

Performance:

• Added sync.Pool frame pools for EffectFrame, BindFrame, ThenFrame (perf: pool-based frame reuse and named continuations #4)
• Pooled internal frame chain nodes during evaluation (perf: pool-based frame reuse and named continuations #4)
• Reused Suspension across Resume calls, saving one allocation per step (perf: pool-based frame reuse and named continuations #4)
• Named identity continuations produce static function values (perf: pool-based frame reuse and named continuations #4)

Compatibility

• Go: 1.26+

---

This discussion was created from the release kont v0.1.2 — Pool-based frame reuse.

[pratikrath126]

Pool-based frame reuse sounds like a solid optimization for performance. If you have any benchmarks or 'before/after' metrics, those would be awesome to see! Keep up the great work on kont.