|
Without knowing which pure area you work in, I can only surmise that you have at least some category theory, which is the theoretical underpinning of type theory. Add in algebraic types, aka sum types, and you may have a solid theoretical background for modern programming research, especially functional programming. Combine that with a previous interest in assembler, et al, and there may be an interesting possibility of compiler optimization, byte code generation, etc. How would one add introspection and pure functional programming with tail calls to a language such as Rust, e.g., and still maintain all of its safety guarantees while keeping build times reasonable? As an aside, there is plenty of work for those with solid assembler or other low level experience. Don’t think commercial end user or web software, think embedded hardware, IoT HW, etc. my employer, e.g., will be adding FPGAs to our high security hardware products, and we will need that low level experience. We’re not hiring yet, but we aren’t the only ones out there. Heck, maybe that’s an area of interest: marrying an open source tool chain to a high level, functional language, to an FPGA and getting performant, safe code that is not beholden to the arcana of specific manufacturers. |
Afaik "category theory [as an] underpinning of type theory" is quite far from true: you can model some type theory with category theory, but it's mostly about modelling, the correspondence is very finicky once you get to the details, and it doesn't help _that much_ for practice. Then, knowing the bit of CT that a typical mathematician knows is not going to amount to much or anything very helpful, in practice, and for the things it will help with (probably going to be quite theoretical cutting edge research), you'll have plenty of people that studied exactly that working on it…
I'd like it to be the case, but being able to describe Yoneda and knowing about assembler is, I think, a far cry from getting you anywhere near these jobs.