[Resending because the original failed to send. Apologies for any duplicates.]
Hello, I am an assistant professor at NUS and have multiple PhD and post-doc positions available. I am launching an effort in the newly emerging paradigm of lattice/fixed-point oriented programming [1], but topics for these positions are negotiable. Paid internships prior to joining are also possible. My research broadly focuses on enabling programmers to write clear, concise and elegant code and doing so without sacrificing performance. This includes work on next-generation languages, compilers and optimization, domain specific and extensible languages, generic and meta-programming, duality, syntax and parsing, and static analysis/control-flow analysis. If you or someone you know might be interested in one of these positions, email me at "adamsmd AT nus.edu.sg" to arrange an informal video call. I will also be at ICFP 2023 all next week, so if you are there, please arrange to talk with me. About me and my research: - Homepage: https://michaeldadams.org/ - Research Goals: https://michaeldadams.org/vitae/research-statement.pdf - Papers: https://michaeldadams.org/papers/ [1] Lattice/Fixed-point oriented programming is an emerging programming paradigm that lets one write programs in terms of inference rules that climb a lattice. While that might sound like obscure theory, in practice, it greatly simplifies many complex algorithms in domains such as parsing, static analysis, type-checking, graph algorithms, and automata minimization. In fact, many classic algorithms such as Dijkstra's algorithm, CYK parsing, Hopcroft's automata minimization algorithm, and tree automata minimization can be expressed in only two or three executable lines of code. If you email me for more information on this, I can send you an unreleased white-paper that I am drafting on the topic. -- Michael D. Adams _______________________________________________ Haskell mailing list Haskell@haskell.org http://mail.haskell.org/cgi-bin/mailman/listinfo/haskell
