I'm showing the concept of the type inference algorithm for Hindley-Milner based type systems. Briefly, with super simple examples, to give the rough idea of how it works. Based on the presentation I gave some time ago at work.
The article is based on the talk I gave at #8 Wrocław TypeScript meetup. I'll show some handy and blazingly fast persistent data structure.
“Raw SQL? Like dinosaurs?” My professor once said. Then I used ORM in the existing project. Results? Dropped database.
If you have a database system with soft deletes and unique indexes you might have faced some problems. Imagine that a user deleted some record and wants to add another one with the same unique value. He can’t do that since unique constraint would be violated...
This article is based on the talk I gave at the 1st Wrocław TypeScript Meetup.
Catchy title, isn’t it? 🙃
The most popular method of logging in to an application is by providing a username and a password, but that may come with some cons for users...
