| :: Hoonlet | |
| :: | |
| |= n=@ | |
| ?: =(n 0) | |
| 1 | |
| (mul n $(n (dec n))) | |
| :: | |
| :: Commie Hoontard | |
| :: (...daydreaming of his very own Type 59...) | |
| :: |
| package main | |
| import ( | |
| "flag" | |
| "html/template" | |
| "log" | |
| "net/http" | |
| "strings" | |
| ) |
The Y Combinator is a classic lambda calculus construct that many people find baffling. Here's my attempt to explain it as clearly as possible (no promises!). Familiarity with Haskell syntax is assumed.
The problem we're trying to solve is how to write an anonymous function (a "lambda") that is recursive. Normally, if you want to write a recursive function, it looks like this:
fac n = if n == 0 then 1
else n * fac (n-1)
| #include <stdio.h> | |
| #include <stdbool.h> | |
| // Maybe | |
| typedef struct MaybeInt { | |
| int just; | |
| bool nothing; | |
| } MaybeInt; |
| Dead arms detected by running the above script on urbit/urbit tip, against a corpus | |
| of ~300k lines of Hoon (including urbit/urbit itself and various community repos): | |
| urbit/pkg/autoprop/sur/sole.hoon: | |
| +sole-gen | |
| urbit/pkg/autoprop/lib/ethereum.hoon: | |
| +address-to-checksum | |
| +batch-read-request | |
| +encode-atoms | |
| +light-json-request |
| package main | |
| import ( | |
| "fmt" | |
| ) | |
| func main() { | |
| fmt.Println(renderBNT(19)) | |
| } |
| #include<stdio.h> | |
| #include<string.h> | |
| #include<stdlib.h> | |
| #include<sys/mman.h> | |
| typedef void V;typedef int I;typedef double F;typedef unsigned char C,*S;typedef long L; | |
| #define O printf | |
| #define R return | |
| #define I(a...) if(a) | |
| #define W(a...) while(a) |
| |= n=@ | |
| =< | |
| |^ | |
| (fib-dec (interp fib-prog (fib-enc n))) | |
| ++ fib-prog | |
| :~ 17^65 | |
| 133^34 | |
| 17^19 | |
| 23^17 | |
| 2.233^69 |
| package main | |
| import ( | |
| "bufio" | |
| "fmt" | |
| "log" | |
| "os" | |
| "strings" | |
| "github.com/NebulousLabs/Sia/modules" |
This is a handy reference for setting up and using git to contribute to projects on GitHub. It is by no means a complete guide to using git; use http://gitref.org for that.
Update: This site provides some excellent visualizations of what various git commands do. Highly recommended.
First run the following commands, using your real name and GitHub email address: