4 ms·
Dana Scott; I found https://www.cs.ox.ac.uk/files/298/handbook.pdf https://www.cs.ox.ac.uk/files/298/handbook.pdf helpful before reading him directly. (he star
by 082349872349872 2y ago
Dana Scott; I found https://www.cs.ox.ac.uk/files/298/handbook.pdf https://www.cs.ox.ac.uk/files/298/handbook.pdf helpful before reading him directly.
(he started off trying to formalise denotational semantics with powersets, and only after failing there fell back to dcpo's; recently I was reading something about the one-to-one correspondence between finite posets and finite topologies which implied that for the infinite case he should've expected to wind up with dcpo's in general when the particular nice cases are lattices, but now I'm blanking on what [and where] it was.
Slogan: computer scientists prefer their models topless.)
https://github.com/CMU-HoTT/scott/ https://github.com/CMU-HoTT/scott/ looks like a nice collection! I also liked Scott & Rabin 1958, but HN didn't.
https://hn.algolia.com/?q=Finite+Automata+and+Their+Decision+Problems https://hn.algolia.com/?q=Finite+Automata+and+Their+Decision...