If you're looking for something good and hard to work on, RTA maintains a list of open problems. It looks kind of out of date, but they are keeping some parts of it updated at least; decidability of higher-order matching is correctly listed as solved (it's decidable, Stirling '06)
If you're looking for something good and hard to work on, RTA maintains a list of open problems. It looks kind of out of date, but they are keeping some parts of it updated at least; decidability of higher-order matching is correctly listed as solved (it's decidable, Stirling '06)
-
(no subject)
Something that's bugged me for a long time is this: How many paths, starting at the origin, taking N steps either up, down, left or right, end up at…
-
(no subject)
Still sad that SAC seems to end up being as complicated as it is. Surely there's some deeper duality between…
-
(no subject)
I had already been meaning to dig into JaneSt's "Incremental" library, which bills itself as a practical implementation (in ocaml) of the ideas in…
- Post a new comment
- 1 comment
- Post a new comment
- 1 comment