AndrewKvalheim

#!/usr/bin/env bash
set -Eeuo pipefail

[[ "$(gsettings get org.gnome.shell disable-user-extensions)" == 'true' ]] || exit

case "$(notify-send --urgency 'critical' --icon 'extensions' \
  'Extensions have been automatically disabled.' \
  --action 'enable=Re-Enable' \
  --action 'settings=Settings…')" \
in

dbuenzli

(* OCaml Port of fig. 5-6 of https://trojansource.codes/trojan-source.pdf *)

let access_level = "user"
let main () =
  if access_level <> "user‮⁦ (* Check if admin *)⁩⁦" then
    Printf.printf "You are an admin.\n"

let () = main ()

p4bl0-

This project is a tiny compiler for a very simple language consisting of boolean expression.

The language has two constants: 1 for true and 0 for false, and 4 logic gates: ! (not), & (and), | (or), and ^ (xor).

It can also use parentheses to manage priorities.

Here is its grammar in BNF format:

expr ::= "0" | "1"

JoeyBurzynski

58 bytes of CSS to look great nearly everywhere

When making this website, i wanted a simple, reasonable way to make it look good on most displays. Not counting any minimization techniques, the following 58 bytes worked well for me:

main {
  max-width: 38rem;
  padding: 2rem;
  margin: auto;
}

AndyShiue

I think I’ve figured out most parts of the cubical type theory papers; I’m going to take a shot to explain it informally in the format of Q&As. I prefer using syntax or terminologies that fit better rather than the more standard ones.

Q: What is cubical type theory?

A: It’s a type theory giving homotopy type theory its computational meaning.

Q: What is homotopy type theory then?

A: It’s traditional type theory (which refers to Martin-Löf type theory in this Q&A) augmented with higher inductive types and the univalence axiom.

joncardasis

"""
Author: Jonathan Cardasis
"""

import socket
import signal # Allow socket destruction on Ctrl+C
import sys
import time
import threading

andrejbauer

Are all functions continuous?

Mathematical background

Brouwer's statement "all functions are continuous" can be formulated without reference to topology as follows.

Definition: A functional f : (N → N) → N is continuous at a : N → N when there exists m : N such that, for all b : N → N, if ∀ k < m, a k = b k then f a = f b.

yang-wei

Should be work with 0.18

Destructuring(or pattern matching) is a way used to extract data from a data structure(tuple, list, record) that mirros the construction. Compare to other languages, Elm support much less destructuring but let's see what it got !

Tuple

myTuple = ("A", "B", "C")
myNestedTuple = ("A", "B", "C", ("X", "Y", "Z"))

ocornut

Memory Optimization (Christer Ericson, GDC 2003)
http://realtimecollisiondetection.net/pubs/GDC03_Ericson_Memory_Optimization.ppt

Cache coherency primer (Fabian Giesen)
https://fgiesen.wordpress.com/2014/07/07/cache-coherency/

Code Clinic 2015: How to Write Code the Compiler Can Actually Optimize (Mike Acton)
http://gdcvault.com/play/1021866/Code-Clinic-2015-How-to

rkrishnasanka

                        Walter Bright's MEM Package
                        ---------------------------


PREFACE:
--------

The files, MEM.H and MEM.C which constitute the MEM package were originally
published in the March-April 1990 edition of Micro Cornucopia magazine, now
sadly out of print.  The files as they appear in SNIPPETS have been edited