# An introduction to program synthesis (Part II) - Automatically generating

**URL:** <https://discourse.haskell.org/t/an-introduction-to-program-synthesis-part-ii-automatically-generating/13224>\
**Category:** Links\
**Created:** [November 5, 2025, 10:42am UTC](https://discourse.haskell.org/t/an-introduction-to-program-synthesis-part-ii-automatically-generating/13224 "2025-11-05T10:42:35Z")\
**Posts on this page:** 1\
**Page:** 1

<div class="post-metadata">

**Author:** ![mchav](https://sea2.discourse-cdn.com/flex002/user_avatar/discourse.haskell.org/mchav/32/5143_2.png) [@mchav](https://discourse.haskell.org/u/mchav)\
**Post date:** [November 5, 2025, 10:42am UTC](https://discourse.haskell.org/t/an-introduction-to-program-synthesis-part-ii-automatically-generating/13224/1 "2025-11-05T10:42:35Z")

</div>

> **[An introduction to program synthesis (Part II) - Automatically generating...](https://mchav.github.io/an-introduction-to-program-synthesis-part-ii/)**
>
> Introduction
> This post kicks off the second part of a hands-on series about program synthesis. We’ll apply the previously explored technique (an enumerative bottom-up search) to a slightly more realistic problem: automatically generating features for...
