I don't have much to say about this topic since I don't fully understand it.
Basically here are the types of equality I've found:
- Axiomatic
- Defined
- Identity
| (* In relation to https://cstheory.stackexchange.com/questions/40631/how-can-you-build-a-coinductive-memoization-table-for-recursive-functions-over-b *) | |
| Require Import Vectors.Vector. | |
| Import VectorNotations. | |
| Set Primitive Projections. | |
| Set Implicit Arguments. | |
| Inductive binTree : Set := | |
| | Leaf : binTree | |
| | Branch : binTree -> binTree -> binTree. |
| #!/bin/bash | |
| # Sometimes you need to move your existing git repository | |
| # to a new remote repository (/new remote origin). | |
| # Here are a simple and quick steps that does exactly this. | |
| # | |
| # Let's assume we call "old repo" the repository you wish | |
| # to move, and "new repo" the one you wish to move to. | |
| # | |
| ### Step 1. Make sure you have a local copy of all "old repo" | |
| ### branches and tags. |
| (* | |
| Some lemmas that can be used in conjunction with those in Coq.Lists.List | |
| See https://coq.inria.fr/library/Coq.Lists.List.html | |
| *) | |
| Require Import Lia. | |
| Require Import Coq.Lists.List. |
| """ | |
| Written to help twitter user @mukesh_tiwari | |
| understand | |
| https://asecuritysite.com/zero/ped | |
| This implementation however is broken, as | |
| q is not a prime... | |
| Below is showing how we can sign a message m2 which |
(draft; work in progress)
See also:
| package bp | |
| import ( | |
| "crypto/elliptic" | |
| "crypto/rand" | |
| "crypto/sha256" | |
| "encoding/binary" | |
| "math/big" | |
| "fmt" |
| #!/usr/local/Gambit-C/bin/gsi | |
| ; Copyright (C) 2004 by Marc Feeley, All Rights Reserved. | |
| ; This is the "90 minute Scheme to C compiler" presented at the | |
| ; Montreal Scheme/Lisp User Group on October 20, 2004. | |
| ; Usage with Gambit-C 4.0: | |
| ; | |
| ; % ./90-min-scc.scm test.scm |