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
Require Import Utf8. | |
Require Import Coq.Program.Tactics. | |
(* When using typeclasses in Coq, people often debate over whether you should | |
use them bundled or unbundled. Each has their own benefits in particular | |
situations. However, you can actually use them both at the same time to get the | |
best of both worlds! *) | |
(* We start with defining several unbundled typeclasses for the sake of defining | |
groups. *) |
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
% Simplification and binarization of Prolog clauses. | |
% | |
% This code was my note paper while reading | |
% "The BinProlog Experience: Architecture and | |
% Implementation Choices for Continuation Passing | |
% Prolog and First-Class Logic Engines" by Paul Tarau. | |
% | |
% I find it especially pleasing that binary logic programs | |
% require only about half as many WAM instructions as | |
% traditional Prolog. This should make it easy to build |
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
from time import sleep | |
__author__ = "Sahand Saba" | |
def nobody(): | |
while True: | |
yield False | |