-
Greetings,
While grinding my way through a large theorem, I ran into an issue where SBCL (the Lisp backend that I am using) runs out of memory for garbage collection. This causes a hard crash of t…
-
(if they still exist).
-
The references hidden inside compsets make manipulating them a pain. They also make concurrent operation hard.
mn200 updated
1 month ago
-
{{{
# !html
Reply to: noreply@sort.ucd.ie
}}}
{{{
Feature Requests item #116, was opened at 2005-08-08 20:17
You can respond by visiting:
http://sort.ucd.ie/tracker/?func=detail&atid=444&aid=116&gro…
atiti updated
11 years ago
-
Thank you for this site. I once had a dream of hunting down exotic archaic LCF theorem provers. So I'm impressed to see it already done.
If it would be welcome, at some point I'd like to donate th…
dsyme updated
3 years ago
-
Hi I want to bring this research to your attention because I think it's really cool and potentially applicable here.
Matthew Flatt, of [Racket](https://racket-lang.org/), has developed a new system…
-
We eventually want to support full-on automated theorem prover integration, but would it be possible to model a handful of simple relationships between spaces ("is a (closed) subspace of", "is a produ…
-
@benjub recommended tweaking the Gource captions about books and articles in https://github.com/metamath/set.mm/pull/1620#issuecomment-621776957 , but that issue is already closed, so here is a new is…
-
Most, or at least some theorem provers include backends that output proofs in some format. It would be nice if frogtptp and/or frogmap was able to produce these proofs and check them with the appropri…
Gbury updated
8 years ago
-
Provide a possibility to name sentences. This is essential for keeping the overview when using a theorem prover with large theories.