Code and proofs for Verse-ML, an equation-style sub-ml language. Part of an undergraduate senior thesis with Norman Ramsey, Milod Kazerounian, and Roger Burtonpatel.
5
stars
0
forks
source link
Implement match compilation as a source-to-source transformation #19
Write a match compiler that turns an arbitrary case expression into a decision tree. It should be recursive, so it can eventually evolve into a recursive function that turns an arbitrary if ⋯ fi into a decision tree.
Write a match compiler that turns an arbitrary
case
expression into a decision tree. It should be recursive, so it can eventually evolve into a recursive function that turns an arbitraryif ⋯ fi
into a decision tree.