-
I think the last rule should include ε, to make T -> 0|1|ε. This is because the original grammar does not generate "01#10" nor "10#01" which is described by the language. Adding the ε to T will allow …
-
Might have missed something but so far I think the following is happening:
Rust `intrinsics::sinf32()` is substituted with C `sinf()` which itself seems to be substituted inside CBMC.
This code do…
-
MetaPRL theory files get inherited quotations from declared parent files, by direct iter `Quotation.add` over them, however 8.00 now adds check to `Quotation.add` that quotations with the same name ca…
-
As far as I understand, Agda's (idealized) core type theory has only top-level definitions, rather than allowing an eliminator to be applied at any point in the program. This doesn't lead to a loss of…
-
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/…
-
#### Description of the problem
```coq
(* -*- mode: coq; coq-prog-args: ("-emacs" "-w" "+implicit-core-hint-db,+implicits-in-term,+non-reversible-notation,+deprecated-intros-until-0,+deprecate…
-
I'm probably one of the biggest Haskell fanboys alive: I [blog about Haskell](haskellforall.com) and also maintain several [Haskell packages](https://hackage.haskell.org/user/GabrielGonzalez). I beli…
-
# What do we mean by "the foundations of mathematics"?
[https://lawrencecpaulson.github.io/2023/11/01/Foundations.html](https://lawrencecpaulson.github.io/2023/11/01/Foundations.html)
-
Hi, Congratulations on your work!
The page spread previews published on illustratedtheoryofnumbers.wordpress.com look fantastic! Lucid explanations, beautifully designed… I would love to get a copy…
-
It might be nice to have a syntax for specifying lexical binding rules for languages. Currently, the best way to do name resolution is inside an attribute/operation, but this makes it more difficult t…