-
As the title says...
-
This code snippet:
~~~rust
println!("#sirver x: {:#?},y: {:#?},zoom: {:#?}", x, y, zoom);
let out = googleprojection::from_pixel_to_ll(&(x, y), zoom).unwrap();
println!("#sirver out: {:#?}", out…
-
I tried to encode a simple directed graph library and crashed stainless with this error:
https://github.com/NicolasRouquette/stainless-bundle-closure/tree/10366df0c54395dd99bacb9451256c625d3ef5cc#v…
-
I'm trying to build a Watch Face Format Sample.
When I enter ./build-wff.sh SimpleDigital in the terminal,
Error: AAPT2 not defined, please set and try again
e.g. /build-tools//aapt2
It comes ou…
-
It is possible to implement Hilbert-style deduction system in SMT language and then get the proof. Here is an example in attachment.
[Hilbert_system.txt](https://github.com/digama0/mm0/files/6396050/…
-
mf168 updated
8 years ago
-
One of the annoyances I had with mmj2 was that I had to play tokenizer myself.
It would be cool if I could write (ph -> ps) or (A+ B) as for very large nested brackets there is a lots of spaces I h…
-
This is two problems: the loop statement runs out-of-bounds and always starts with i = 1 .
The canonical test is set.mm/miu.mm which has both zero-length wffs and a single uncompressed proof at the e…
-
On something like this:
![image](https://cloud.githubusercontent.com/assets/396076/22914785/9c10635c-f240-11e6-98df-d1546f9fd93d.png)
```coq
Unable to unify
"wff (flatten_binding_list ?M1499 ?M15…
-
It would be better for the axioms from namespace propositional (hypothesis_addition, conditional_modus_ponens, ...) to check whether their arguments are well-formed, wouldn't it?
For example, do we…