books-programmingLanguages-programmingLanguagesPartFormal

Table of Contents for Programming Languages: a survey


Part : Formal stuff

Note on academia research: academia is great but:

upshot: lots of hidden gems but huge time committment to find them and read them. Can't trust language in papers that claims that this or that is important for you to know.

http://www.cis.upenn.edu/~bcpierce/courses/670Fall04/GreatWorksInPL.shtml

http://lambda-the-ultimate.org/

c2.com

retrospective papers and blog posts by designers of great languages

preferentially read academic works that are designed to be read easily, rather than only to get past reviewers:

review papers textbooks talk slides introductory-ish encyclopedic works

note: if you ARE a programming languages academic, reading only these will be insufficient; you also have to keep up with some current literature, so that you are well-placed to make a new contribution.


todo:


universal combinatorial logic (not turing universal):

" Proposition 3 (Post) A necessary and sufficient condition that a set of operations form a basis for the nonzeroary Boolean operations is that it contain operations that are respectively nonaffine, nonmonotone, nonstrict, noncostrict, and nonselfdual " -- http://boole.stanford.edu/cs353/handouts/book3.pdf

NAND and NOR are universal

---

unconventional computer implementations:

https://news.ycombinator.com/item?id=7824588


Links


Chapter ?: CS theory 101 Chapter ?: Models of computation (Turing-equivalent systems) (also, models of concurrent computation) Chapter ?: Sub-Turing models of computation Chapter ?: Halting Chapter ?: Semantics