Liam O'Connor liamoc

A few thoughts below about this anonymous person threatening two female academics in my area. Roopsha for complaining about discrimination at Perdue where she was denied tenure (for speaking up?) and Talia for vocally supporting her.

I think this person is awful and feel for both Roopsha and Talia for receiving such threats. Opinion aside, they are pointing to potential problems in the tenure system and potential harms that can come from complaining about sexism and discrimination.

This could be valuable information. From an information theoretic perspective, information identifying the reasons for systems not to operate as we want them is valuable in learning how to improve the systems. With that said, what are the shortages this person identified?

First, they are describing a potentially problematic structure communities that can cause major harm in speaking up. Namely, small communities with lots of friendships (conflicts of interest) and how in such structure criticising powerful entities could result

Install rosetta, command line tools, etc.
install gnu tar, gnu coreutils and bash from brew.
compile this dylib https://github.com/yairchu/macos11-haskell-workaround
clone ghcjs 8.6 branch and submodules
install ghc 8.6 and cabal-install 2.4 with ghcup
Edit the ghcup ghc wrapper script to add the dylib to DYLD_INSERT_LIBRARIES before invoking ghc
Edit the ./ghc/aclocal.m4 and remove the underscore before AC_
Edit the ./utils/makePackages.sh to use the brew-installed bash
Run the makePackages script
Run cabal install, have a cup of tea

	section
	parameters {α : Type}
	variable [ a_dec : decidable_eq α]
	include a_dec
	open nat

	definition replicate (a : α) : ℕ → list α
	\| 0 := []
	\| (succ n) := a :: replicate n

	module bugreport where

	open import Data.Nat
	open import Data.Bool hiding (_≟_)
	open import Relation.Nullary

	⸤_⸥ : {A : Set} → Dec A → Bool
	⸤ yes _ ⸥ = true
	⸤ no _ ⸥ = false

	Tests
	basics
	arbitrary instance: wf(l): OK (0.04s)
	+++ OK, passed 5000 tests.
	take, drop
	take
	commutativity: take n ∘ take m ≡ take m ∘ take n: OK (1.57s)
	+++ OK, passed 5000 tests.
	accumulativity: take m ∘ take n ≡ take (m ⊓ n): OK (1.54s)
	+++ OK, passed 5000 tests.

	;;; 2048.el --- play 2048 in Emacs (updated graphical version)

	;; A mild extension for graphical improvements on the 2048-game.el
	;; by Liam O'Connor to the game 2048 implemented in emacs by
	;; Zachary Kafner

	;; Copyright 2014 Zachary Kanfer

	;; Author: Zachary Kanfer <[email protected]>
	;; Version: 2014.03.27

	{-# LANGUAGE GADTs, KindSignatures #-}
	module FakeWebFramework (add , notActuallyAWebFramework, get, Handler', link) where

	import UrlPath
	import Control.Monad.Writer
	import Data.Maybe

	maybeRead :: (Read a) => String -> Maybe a
	maybeRead s = case reads s of
	[(x, "")] -> Just x

	// needs -fnested-functions. Can be done without, but makes the whole thing a lot more cumbersome
	// and less useful.
	#include <stdio.h>

	#define my_data_alts ( void (A)(int) , void (B)(int, int) , void (*C)(char, int) )
	#define make_my_data(n) void n my_data_alts
	typedef void (*my_data) my_data_alts;


	void show(my_data match) {

	{-# LANGUAGE OverloadedStrings #-}
	module Main where

	import Data.Yaml
	import System.Environment
	import Control.Applicative

	data Whatever = Foo { courses :: [String], required :: Int } deriving Show

	instance FromJSON Whatever where