This file contains hidden or 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
| From Stdlib Require Import List Relations Classes.RelationClasses Classes.Morphisms. | |
| Definition list_ext A : relation (list A) := fun l l' => forall x, In x l <-> In x l'. | |
| Class Associative {A : Type} (op : A -> A -> A) := | |
| assoc : forall x y z, op x (op y z) = op (op x y) z. | |
| Class Commutative {A : Type} {B : Type} (op : A -> A -> B) := | |
| comm : forall x y, op x y = op y x. |
This file contains hidden or 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 yew::{html, Component, Context, Html}; | |
| use gloo::console::{self}; | |
| use std::collections::VecDeque; | |
| #[derive(Debug, Clone)] | |
| pub struct Annot { | |
| } | |
| impl Default for Annot { | |
| fn default() -> Annot { Annot { } } |
This file contains hidden or 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
| export BASH_SILENCE_DEPRECATION_WARNING=1 | |
| # https://github.com/dotzero/iTerm-2-Peppermint | |
| git_branch () { | |
| if git rev-parse --git-dir >/dev/null 2>&1 | |
| then echo -e "" [ $(git branch 2>/dev/null| sed -n '/^\*/s/^\* //p')] | |
| else | |
| echo "" | |
| fi | |
| } | |
| function git_color { |
This file contains hidden or 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
| { | |
| "~P" = (insertText:, "Π"); | |
| "~s" = (insertText:, "ş"); | |
| "~S" = (insertText:, "Ş"); | |
| "~k" = (insertText:, "ı"); | |
| "~K" = (insertText:, "İ"); | |
| "~g" = (insertText:, "ğ"); | |
| "~G" = (insertText:, "Ğ"); | |
| "~l" = (insertText:, "λ"); | |
| "~L" = (insertText:, "Λ"); |
This file contains hidden or 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
| {-# LANGUAGE TypeFamilies, FlexibleContexts #-} | |
| import Data.Data | |
| import Unsafe.Coerce | |
| type family Last (a :: *) :: * where | |
| Last (b -> c) = Last c | |
| Last d = d | |
| full :: (Typeable a, Data (Last a)) => a -> Last a | |
| full x = case typeRepArgs (typeOf x) of |
This file contains hidden or 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
| Inductive color := red | green | blue. |
This file contains hidden or 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
| {-# LANGUAGE AllowAmbiguousTypes #-} | |
| {-# LANGUAGE DeriveDataTypeable #-} | |
| {-# LANGUAGE FlexibleContexts #-} | |
| {-# LANGUAGE FlexibleInstances #-} | |
| {-# LANGUAGE IncoherentInstances #-} | |
| {-# LANGUAGE ScopedTypeVariables #-} | |
| {-# LANGUAGE TypeApplications #-} | |
| {-# LANGUAGE UndecidableInstances #-} | |
| module Scott where |
This file contains hidden or 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
| %language ElabReflection | |
| data SatisfyPairs : (a -> a -> Type) -> List a -> Type where | |
| SatEmpty : SatisfyPairs p [] | |
| SatSingleton : SatisfyPairs p [x] | |
| SatPair : p x y -> SatisfyPairs p (y :: ys) -> SatisfyPairs p (x :: y :: ys) | |
| MonotonicallyIncreasingNat : List Nat -> Type | |
| MonotonicallyIncreasingNat = SatisfyPairs LTE |
This file contains hidden or 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
| \documentclass{standalone} | |
| \usepackage{tikz-cd} | |
| \usepackage{amsmath} | |
| \usepackage{tgpagella} | |
| \begin{document} | |
| \begin{tikzcd} | |
| & & \lambda\omega \arrow[rrr] & & & \lambda\Pi\omega \\ | |
| & & & & & \\ | |
| \lambda 2 \arrow[rruu] \arrow[rrr] & & & \lambda\Pi 2 \arrow[rruu] & & \\ |
This file contains hidden or 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 Unquote | |
| %access public export | |
| ||| An interface to recover things from their canonical representations | |
| ||| as reflected terms, i.e. to reify things. | |
| ||| | |
| ||| This interface is intended to be used during proof | |
| ||| automation and the construction of custom tactics. | |
| ||| | |
| ||| @ t the type to quote it from (typically `TT` or `Raw`) |
NewerOlder