-
| | |
|--------------------|----|
| Bugzilla Link | [PR31613](https://bugs.llvm.org/show_bug.cgi?id=31613) |
| Status | REOPENED |
| Importance | P norma…
-
> And it would be useful to have an example in the article showing a newbie how to
> do your suggestion about making the lines short enough, as they are certainly
> likely to write poorly conceived …
-
This summer, two undergraduates will be joining my lab for an REU program; the first one starts next week. My current plan is to have them work with me and some of my students to build up a full fled…
parno updated
3 months ago
-
~~~
test_all is a Catch v2.13.10 host application.
Run with -? for options
-------------------------------------------------------------------------------
Congruence 029: left congruence on fini…
-
Name: Jihwan Park
According to the 21st slide of lecture6, it seems that axioms of T_cons contain function congruences only for cons, car, and cdr. If this is correct, can we get f(a)=f(b) from the…
-
In `c/pthread/fib_safe-5.i` from #1356, we produce an unsound invariant. Opening the HTML view to see globals reveals that they somehow have all integer domains enabled (#1472):
> base:priv:unprotect…
-
In lampepfl/dotty#6023 @anatoliykmetyuk asked a theoretical question, and @smarter forwarded it to me, to investigate it in DOT.
> I have not found a proof anywhere that `F[A] & F[B]
-
-
# Burnside's Lemma and Pólya Enumeration Theorem
It is used to count/find combinatorial objects (i.e. equivalence classes or orbits) associated with symmetry groups.
It is a result in group the…
-
Within the coercion frameworks, two objects are usually compared by using `_richcmp_`. Using this, both objects are coerced into an element of a common parent before the comparison is performed. The…