caledon
caledon copied to clipboard
mmirman
higher order dependently typed logic programing
Results
2
caledon issues
Sort by
recently updated
recently updated
newest added
For example, the following will stall when `lpn` is reached. ``` defn list : prop → prop >| nil = list P >| cons = P → list P →...
For whatever reason, the Caledon program will stall, eating up an arbitrarily large amount of memory when encountering certain code which should instead produce syntax errors. Here are some examples...