Separate constraint gathering and solving

robrix / path

A lambda calculus to explore type-directed program synthesis.

BSD 3-Clause "New" or "Revised" License

83 stars 2 forks source link

Closed robrix closed 5 years ago

robrix commented 5 years ago

This PR separates constraint gathering from constraint solving, doing elaboration in a single pass prior to constraint solving.

robrix commented 5 years ago

There’s still some distance to go before this is finished, but I think I’ve proven the viability of the approach, so gonna merge into #67.