1 citations · 1 across the 3 of their papers we have counts for
Showing cs.PLShow all
2 papers · 1 filter
cs.PL2024★ 1 cited
Example-Based Reasoning about the Realizability of Polymorphic Programs
Niek Mulleners, Johan Jeuring, Bastiaan Heeren
Parametricity states that polymorphic functions behave the same regardless of how they are instantiated. When developing polymorphic programs, Wadler's free theorems can serve as f…
cs.PL2022
Program Synthesis Using Example Propagation
Niek Mulleners, Johan Jeuring, Bastiaan Heeren
We present Scrybe, an example-based synthesis tool for a statically-typed functional programming language, which combines top-down deductive reasoning in the style of with Sm…