- Automated Theorem Proving (ATP) - Attempting to prove mathematical theorems automatically.
- Bottlenecks in ATP:
- Autoformalization - Semantic or formal parsing of informal proofs.
- Automated Reasoning - Reasoning about already formalised proofs.
- Paper evaluates the effectiveness of neural sequence models for premise selection (related to automated reasoning) without using hand engineered features.
- Link to the paper
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
context: https://stackoverflow.com/questions/74695464/why-cant-i-install-ruby-3-1-2-in-linux?noredirect=1#comment131843536_74695464 | |
``` | |
$ ruby-build --definitions | |
1.8.5-p52 | |
1.8.5-p113 | |
1.8.5-p114 | |
1.8.5-p115 | |
1.8.5-p231 | |
1.8.6 |
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
``` | |
conda install -c conda-forge opam | |
... | |
This path already exists in the target prefix, and it won't be removed | |
by an uninstall action in this transaction. The path is one that conda | |
doesn't recognize. It may have been created by another package manager. | |
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
""" | |
Use this one to make sure the "end" is shown properly 100% etc | |
""" | |
import time | |
import progressbar | |
widgets = [ | |
progressbar.Percentage(), | |
progressbar.Bar(), |
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
(* -*- mode: ocaml; -*- *) | |
module type FUNCTOR = sig | |
type 'a t | |
val map : ('a -> 'b) -> 'a t -> 'b t | |
end | |
type 'a monoid = {unit : 'a ; join : 'a -> 'a -> 'a} | |
type var = string |
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
import subprocess | |
def talk_to_python_interactively(): | |
fw = open("tmpout", "wb") | |
fr = open("tmpout", "r") | |
p = subprocess.Popen(['python'],stdin=subprocess.PIPE,stdout=fw,stderr=fw,) | |
out = frw.readline() | |
print(out) | |
print(len(out)) | |
print(type(out)) |
Sorry, something went wrong. Reload?
Sorry, we cannot display this file.
Sorry, this file is invalid so it cannot be displayed.
Sorry, something went wrong. Reload?
Sorry, we cannot display this file.
Sorry, this file is invalid so it cannot be displayed.
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
(* our first theorem *) | |
Theorem plus_O_n : | |
forall n : nat, | |
0 + n = n. | |
Proof. | |
intros n. | |
simpl. | |
reflexivity. | |
Qed. |
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
CassandraBackend Works | |
in memory queue setup complete | |
in error init test PQ | |
failure in setup { name: 'TimeoutError', | |
message: 'Get a connection timed out', | |
info: 'Represents an error that happens when the maximum amount of time for an operation passed.' } | |
in memory queue setup complete |