Settings: System Preferences » Keyboard » Key Repeat/Delay Until Repeat
Use the commands below to increase the key repeat rate on macOS beyond the possible settings via the user interface. The changes aren't applied until you restart your computer.
open Core_kernel | |
module Ast = struct | |
type ident = string [@@deriving compare, hash, sexp] | |
type t = | |
| Var of ident | |
| Int of int | |
| Let of ident * t * t | |
| App of ident * t list |
Settings: System Preferences » Keyboard » Key Repeat/Delay Until Repeat
Use the commands below to increase the key repeat rate on macOS beyond the possible settings via the user interface. The changes aren't applied until you restart your computer.
{- * Foundational functions -} | |
id :: a -> a | |
id x = x | |
const :: a -> b -> a | |
const x y = x | |
fix :: (a -> a) -> a | |
fix f = f (fix f) |
"Church-encoded" lists and their interesting properties | |
=== | |
*This is a literate Haskell program which you can run in ghci.* | |
*Also, I already corrected a glaring problem. Let us speak no more of it.* | |
One of the beautiful things about computer science is that, fundamentally, | |
**data is code** and **code is data**. But what does that mean? And how is it | |
useful? |
(*--------------------------------------------------------------------------- | |
Copyright (c) 2015 Daniel C. Bünzli. All rights reserved. | |
Distributed under the BSD3 license, see license at the end of the file. | |
%%NAME%% release %%VERSION%% | |
---------------------------------------------------------------------------*) | |
(* Simple generators according to: | |
Kiselyov, Peyton-Jones, Sabry | |
Lazy v. Yield: Incremental, Linear Pretty-printing |
signature COROUTINE = | |
sig | |
type ('a, 'b, 'r) t | |
val await : ('a, 'b, 'a) t | |
val yield : 'b -> ('a, 'b, unit) t | |
(* Monadic interface and stuffs *) | |
val map : ('c -> 'd) -> ('a, 'b, 'c) t -> ('a, 'b, 'd) t | |
val return : 'c -> ('a, 'b, 'c) t |
let rec elem x xs = | |
match xs with | |
| [] -> false | |
| y :: ys -> x = y || elem x ys | |
let rec uniques l = | |
let rec helper l acc = | |
match l with | |
| [] -> acc | |
| x :: xs -> |
""" | |
formula.py - propositional formulas for Python | |
by Robin Wellner | |
Hereby, I waive all rights to this library, as described at <http://creativecommons.org/publicdomain/zero/1.0/> | |
Examples: | |
foo = Atom('foo') | |
bar = Atom('bar') |
#!/bin/bash | |
ssh $1@$2 mkdir -p .ssh | |
cat /Users/luiscorreia/.ssh/id_rsa.pub | ssh $1@$2 'cat >> .ssh/authorized_keys' | |
printf "Host %s\n" "$3" >> /Users/luiscorreia/.ssh/config | |
printf "\tHostName %s\n" "$2" >> /Users/luiscorreia/.ssh/config | |
printf "\tUser %s\n" "$1" >> /Users/luiscorreia/.ssh/config | |
printf "\n" >> /Users/luiscorreia/.ssh/config |
Hello there! This is a sample post for gist.io, a super-lightweight writing soapbox for hackers.
Now look up. Further. Above the post title. See that grey text with the gist ID?
What about some Ruby code:
rb() {
if [[ $# -lt 1 ]]; then
rbenv shell --unset