An proof refinement logic for computational type theory. Inspired by Nuprl. [For up-to-date development, see JonPRL's successor, RedPRL: https://github.com/redprl/sml-redprl]
Currently reduce and Unfold globally apply their transformations. Instead they should be able to optionally take a path (for example, [h. =(foo; bar; h)]) and then only apply their transformations at that spot.
Currently
reduce
andUnfold
globally apply their transformations. Instead they should be able to optionally take a path (for example,[h. =(foo; bar; h)]
) and then only apply their transformations at that spot.