I hereby claim:
- I am matthew-piziak on github.
- I am matthew_piziak (https://keybase.io/matthew_piziak) on keybase.
- I have a public key ASDdrk_u-uaDhXN05JY0y3sZ4QXA_LGhzIn-3Q2DYbqI7Qo
To claim this, I am signing this object:
import pathing | |
import math | |
import pygame | |
import sys | |
import time | |
import random | |
NEWT_START = (0, 0, 0, 0, 0) | |
NEWT_GOAL = (70, 70, 0, 0, 0) | |
ACCELERATION = 0.4 |
error: could not crate bin directory: '/Users/matt.cargo/bin' | |
info: caused by: Permission denied (os error 13) | |
rustup: command failed: /var/folders/jp/9csp82hj70q4ctsctp9tzf_w0000gn/T/tmp.VT5DYWiF/rustup-init |
I hereby claim:
To claim this, I am signing this object:
Testing Gist Integration |
Another potential syntax where you only see your immediate parents and children: | |
* parent 1… | |
* parent 2… | |
* current node | |
Node contents |
Theorem exercise_1_2_1: forall A B C : Ensemble U, | |
Included U A B /\ Included U A C <-> Included U A (Intersection U B C). | |
Proof. | |
intros. | |
split. | |
intros. | |
destruct H. | |
apply Intersection_maximal; assumption. | |
intros. | |
split. |
Haskell gives you many ways to perform binding and destructuring.
Here I'll discuss:
where
bindingslet
bindingsViewPatterns
These are pretty similar and it can be hard to pick which one to use. Here's how I choose.