# Cure - a new language compiled to BEAM **URL:** \ **Category:** Cure Forum\ **Tags:** beam-languages, static-typing, types, fsm\ **Created:** [November 2, 2025, 5:24am UTC](https://erlangforums.com/t/cure-a-new-language-compiled-to-beam/5209 "2025-11-02T05:24:12Z")\ **Posts on this page:** 3\ **Page:** 2
**Author:** ![mudasobwa](https://erlangforums.com/user_avatar/erlangforums.com/mudasobwa/32/231_2.png) [@mudasobwa](https://erlangforums.com/u/mudasobwa)\ **Post date:** [November 27, 2025, 7:01am UTC](https://erlangforums.com/t/cure-a-new-language-compiled-to-beam/5209/23 "2025-11-27T07:01:13Z")
> [@ieQu1](#): > > what kind of termination checking algorithm does it use I delegate to Z3 [Recursive Functions | Online Z3 Guide](https://microsoft.github.io/z3guide/docs/logic/Recursive%20Functions/) ---
**Author:** ![ieQu1](https://erlangforums.com/user_avatar/erlangforums.com/iequ1/32/2633_2.png) [@ieQu1](https://erlangforums.com/u/ieQu1)\ **Post date:** [November 28, 2025, 4:04pm UTC](https://erlangforums.com/t/cure-a-new-language-compiled-to-beam/5209/24 "2025-11-28T16:04:51Z")
Interesting, thanks for the answer. I believe F\* uses similar approach, and they have had problems with compilation brittleness, [partially mitigated](https://github.com/FStarLang/FStar/wiki/rlimits:-Machine-Independent-Resource-Limits-for-Deterministic-Execution). ---
**Author:** ![mudasobwa](https://erlangforums.com/user_avatar/erlangforums.com/mudasobwa/32/231_2.png) [@mudasobwa](https://erlangforums.com/u/mudasobwa)\ **Post date:** [November 29, 2025, 5:24am UTC](https://erlangforums.com/t/cure-a-new-language-compiled-to-beam/5209/25 "2025-11-29T05:24:07Z")
Thanks for the link, I appreciate it. But honestly, I am far from the stage when brittle timeouts in the solver are an issue. [Previous page](https://erlangforums.com/t/cure-a-new-language-compiled-to-beam/5209.md?page=1)