From bdc142f5a4dbff76baed8a6f074de8fe2c7577f8 Mon Sep 17 00:00:00 2001 From: Dane Sabo Date: Wed, 19 Feb 2025 10:41:15 -0500 Subject: [PATCH] vault backup: 2025-02-19 10:41:15 --- 3-99 Research/Haskell/Chapter 1 - Introduction.md | 4 ++++ 1 file changed, 4 insertions(+) diff --git a/3-99 Research/Haskell/Chapter 1 - Introduction.md b/3-99 Research/Haskell/Chapter 1 - Introduction.md index 2ee2422aa..e6e09c49c 100644 --- a/3-99 Research/Haskell/Chapter 1 - Introduction.md +++ b/3-99 Research/Haskell/Chapter 1 - Introduction.md @@ -13,6 +13,10 @@ Functional programming languages do not do this. Instead of using iteratives lik There's a special property about functions that can be called multiple times with the same parameters being guaranteed to return the same result: **Referential Transparency**. This property allows us to deduce and then even proved that a function does exactly what it is supposed to, every time. +Haskell is a statically typed language, and supports type inference. It has been developed since 1987, with the first stable version of the language coming out ofthe Haskell Report in 2003. + +# What I need to dive in: +A Haskell compiler ^1 not really Rust, because I believe Rust has functional programming support.