| The question was asked why I (as a programmer who prefers dynamic languages) don't consider static types "worth it". Here | |
| is a short list of what I would need from a type system for it to be truely useful to me: | |
| 1) Full type inference. I would really prefer to be able to write: | |
| (defn concat-names [person] | |
| (assoc person :full-name (str (:first-name person) | |
| (:second-name person)))) | |
| And have the compiler know that whatever type required and produced from this function was acceptible as long as the |
The LambdaConf Ladder of Functional Programming (LOFP) is a standardized progression of different concepts and skills that developers must master on their journey to becoming expert-level functional programmers. LOFP can be used to rank workshops, talks, presentations, books, and courseware, so that aspiring functional programmers have a better understanding of what material is appropriate for them given their current experience.
| Red [ | |
| Title: "BMR (Basal Metabolic Rate) Calculator" | |
| Author: "Gregg Irwin" | |
| File: %bmr-calc.red | |
| Needs: View | |
| Comment: { | |
| An experiment in reactivity and data modeling. | |
| TBD: Caloric calcs based on activity level. |
This is my attempt to give Scala newcomers a quick-and-easy rundown to the prerequisite steps they need to a) try Scala, and b) get a standard project up and running on their machine. I'm not going to talk about the language at all; there are plenty of better resources a google search away. This is just focused on the prerequisite tooling and machine setup. I will not be assuming you have any background in JVM languages. So if you're coming from Python, Ruby, JavaScript, Haskell, or anywhere… I hope to present the information you need without assuming anything.
Disclaimer It has been over a decade since I was new to Scala, and when I was new to Scala, I was coming from a Java and Ruby background. This has probably caused me to unknowingly make some assumptions. Please feel free to call me out in comments/tweets!
One assumption I'm knowingly making is that you're on a Unix-like platform. Sorry, Windows users.
Copyright © 2016-2018 Fantasyland Institute of Learning. All rights reserved.
A function is a mapping from one set, called a domain, to another set, called the codomain. A function associates every element in the domain with exactly one element in the codomain. In Scala, both domain and codomain are types.
val square : Int => Int = x => x * x
| { pkgs, config, ... }: | |
| { | |
| imports = [ | |
| <nixpkgs/nixos/modules/profiles/headless.nix> | |
| ]; | |
| # Enable sudo logins if the user's SSH agent provides a key | |
| # present in <filename>~/.ssh/authorized_keys</filename>. | |
| # This allows machines to exclusively use SSH keys instead of | |
| # passwords. |
It's now here, in The Programmer's Compendium. The content is the same as before, but being part of the compendium means that it's actively maintained.
Recursion is beautiful. As an example, let's consider this perfectly acceptable example of defining the functions even and odd in Scala, whose semantics you can guess:
def even(i: Int): Boolean = i match {
case 0 => true
case _ => odd(i - 1)
}
def odd(i: Int): Boolean = i match {
Add Graal JIT Compilation to Your JVM Language in 5 Steps, A Tutorial http://stefan-marr.de/2015/11/add-graal-jit-compilation-to-your-jvm-language-in-5-easy-steps-step-1/
The SimpleLanguage, an example of using Truffle with great JavaDocs. It is the officle getting-started project: https://github.com/graalvm/simplelanguage
Truffle Tutorial, Christan Wimmer, PLDI 2016, 3h recording https://youtu.be/FJY96_6Y3a4 Slides
| Write a program that does what it’s supposed to do | |
| Write idiomatic code | |
| Debug a program that you wrote | |
| Debug a program someone else wrote | |
| Debug the interaction between a system you wrote and one you didn’t | |
| File a good bug report | |
| Modify a program you didn’t write | |
| Test a program you wrote | |
| Test a program you didn’t write | |
| Learn a new programming language |