- my website/server/telephone/etc. (my $TOOL)
- my (website's) domain name/phone number/etc (my $TOOL's $IDENTIFIER)
- announce/advertise/host/serve/send/offer content
- system/tool/device/instrument/network/protocol
- get online/connected (through an ISP)
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
module IPL where | |
infixr 90 _&_ | |
infixr 80 _v_ | |
infixr 70 _=>_ | |
data Proposition : Set where | |
True : Proposition |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
module Bounds where | |
data Nat : Set where | |
zero : Nat | |
suc : Nat -> Nat | |
data _<_ : Nat -> Nat -> Set where | |
z<s : forall {n} -> zero < suc n |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
open import Data.Empty renaming (⊥ to FALSE) | |
open import Data.Nat renaming (ℕ to Nat ; _≤_ to _<=_) | |
open import Data.Sum renaming (_⊎_ to Either ; inj₁ to left ; inj₂ to right) | |
open import Relation.Binary.PropositionalEquality renaming (_≡_ to _==_) | |
module NIN where | |
nin : forall {m n : Nat} -> m <= n -> n <= suc m -> Either (m == n) (suc m == n) | |
nin z≤n z≤n = left refl | |
nin z≤n (s≤s z≤n) = right refl |
The following is a rough overview of the collaborative problem solving technique called Structured Dialogic Design.
- Determine stakeholder groups, and knowledgable and trusted people in those groups. Find diverse backgrounds, world experiences, skill sets, specializations, etc. Max ~200, min ~20.
- Construct a good "Triggering Question" that will be the thing to answer during the design sessions.
- Gather folx together in solid time blocks to do the subsequent steps. Usually this is in person, but it can be remote, too. Two full days tends to be time involved, but it can go faster, spread out, etc. as needed.
- Come to a common understanding of the problem and its causes:
Cocksucking has become standard for many gender-bending dykes. But giving head to a rubber or silicone cock--strapped, of course, to one's favorite trick--may seem silly to some. "What's the point?" we've been asked. "It's not like she can feel anything." We disagree.
Many a packing dyke gets off from the pressure exerted on her cunt and from the visual stimulation of having an eager dyke working between her legs. For many, getting or giving head is a favorite
I hereby claim:
- I am bekavalentine on github.
- I am beka_valentine (https://keybase.io/beka_valentine) on keybase.
- I have a public key ASCzOGe_wKybqN0_bwuuuvUhnRAdeVfHhB4y-UwQgVtLnQo
To claim this, I am signing this object:
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
use std::fmt; | |
#[derive(Debug)] | |
enum Type { | |
Number, | |
Prod(Box<Type>, Box<Type>), | |
Fun(Box<Type>, Box<Type>) | |
} | |
#[derive(Debug)] |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
$fn = 100; | |
module radius_gauge(min_radius, max_radius, radius_step, vertical_step_size, padding) { | |
gauge_side = max_radius + padding; | |
vertical_step_count = (max_radius - min_radius) / radius_step; | |
gauge_height = vertical_step_count * vertical_step_size + 2*padding; | |
difference() { | |
cube([gauge_side,gauge_side,gauge_height]); |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
module FinPow where | |
open import Data.Bool | |
open import Data.Nat renaming (ℕ to Nat) | |
open import Data.Fin renaming (zero to fzero ; suc to fsuc) | |
open import Data.Product renaming (Σ to Sg ; proj₁ to proj1 ; proj₂ to proj2) | |
open import Relation.Binary.PropositionalEquality renaming (_≡_ to _==_) | |
record Iso (X Y : Set) : Set where | |
field |
NewerOlder