1 citations · 1 across the 3 of their papers we have counts for
3 papers
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…
cs.HC2020
Model-Driven Synthesis for Programming Tutors
Niek Mulleners, Johan Jeuring, Bastiaan Heeren
When giving automated feedback to a student working on a beginner's exercise, many programming tutors run into a completeness problem. On the one hand, we want a student to experim…