Explore >> Select a destination
|
You are here 
|
blog.jle.im | ||
| | | | |
entangledlogs.com
|
|
| | | | | These are my notes on Generic Programming. Feel free to skim through them. Introduction to Type Type A tool to reason or proving properties of the program Allows understanding and classifying the variables during computation and use Types require compositional calculation i.e. sub-expressions give rise to higher types. Understand dynamically typed as dynamically checked. Motivation of Requiring Types Language Safety/Error Detection Can pinpoint some programming errors rather than in runtime Can guarantee... | |
| | | | |
jamie-wong.com
|
|
| | | | | [AI summary] The post analyzes the tradeoffs between dynamically and statically typed programming languages regarding iteration speed, correctness, and IDE support, discussing how modern languages and techniques are attempting to combine the best aspects of both approaches. | |
| | | | |
kowainik.github.io
|
|
| | | | | Kowainik - Collection of small Haskell patterns with detailed description, examples and exercises | |
| | | | |
danielpecos.com
|
|
| | | Purpose of this post is to providea glimpse of the new features included in Java 8 that shiftthis language towards a more Functional Programming paradigm. But before, let's define what we understand for Functional Programming (FP). Functional programming key characteristics include: Higher Order Functions Pure Functions and Immutability Tail Call Recursion Higher Order Functions for a FP language means that functions are considered first class citizens, allowing the programmer to use them as any other value the language defines, for example, a Function value: | ||
