Open pepite opened 5 years ago
Ok I guess you are not referring as ADT as mathematical term (algebraic data type) but more about Abstract data type ie (List, Map, Set, Queue) and not trying to have the mathematical proof of them. Or are you really referring to Algebraic data type - https://en.wikipedia.org/wiki/Algebraic_data_type? It would be way better to start with Abstract data type for a junior (https://en.wikipedia.org/wiki/Abstract_data_type )
Ok so it is only what they are and how to use then in Haskell I suppose. Nothing about https://en.wikipedia.org/wiki/Type_theory I suppose? Junior level I think that Abstract Data Type is also required and that for any language (functional or not)
Though you might want to study lambda calculus as well (maybe first)... this is the foundation of FP - http://www.dipmat.unict.it/~barba/PROG-LANG/PROGRAMMI-TESTI/READING-MATERIAL/ShortIntroFPprog-lang.htm
and the foundation:
etc..
And SCHEME is an excellent functional programming as well (used it during my studies)
Looking at I am seeing the following:
I did not quite get they were more under it (they should be an indication to scroll down). However, are you sure ADT is junior level? And why is it the first thing a junior sees ;) ?