Damodharan Jayachandran
Member Leadership Staff
Zoho
location_on India
Member since 3 years
Share
Damodharan Jayachandran
Specialises In
Full Stack Dev
Interested in - Compiler Design, Type Theory, Automated Proofs, Blockchain
-
keyboard_arrow_down
Typescript's type system - From solving puzzles to proving facts of program
45 Mins
Demonstration
Beginner
Typescript has gained a lot of traction with majority of javascript frameworks adopting it and gaining the power of static types.
Given the Typescript types are a language themselves and they are Turing complete, lets put our type flavoured favourite language of the web to test - for fun & profit.
With the advent of fp-ts, typescript's boundary to statically type FP algebras like Functor, Monoid & Monad are just a import away!.
But why restrict ourselves when we can achieve more with almost "Dependent types" in typescript - Like solving logical puzzles to proving properties of the program (like type level regex check, indexed list & matrices etc) for correctness.
-
-
No more submissions exist.
