activity
20162025
most citedTurchin's Relation for Call-by-Name Computations: A Formal Approach

3 citations · 4 across the 5 of their papers we have counts for

collaborators
Showing cs.LOShow all

1 paper · 1 filter

cs.LO2018

Supercompiling String Programs Using Word Equations as Constraints

Antonina Nepeivoda

We describe a general parameterized scheme of program and constraint analyses allowing us to specify both the program specialization method known as Turchin's supercompilation and…