Top new questions this week:
|
|
I am trying to understand dependent pattern matching while reading Goguen, McBride, and McKinna (2006)'s paper, but couldn't quite grasp the concept. I know regular pattern matching in functional ...
|
|
I'm reading https://us.metamath.org/mpeuni/mmzfcnd.html and it says
Each "axiom" in Metamath's version of ZFC set theory is not an actual
axiom in the language of first-order logic but is a ...
|
Greatest hits from previous weeks:
|
|
I want to get started with Lean 4, but I need to install it. The download page links to binaries to download, but I don't know what to do with them. Is there a "best practice" way to install ...
|
|
In the init/logic.lean file of the Lean 3 standard library, nonempty and inhabited are defined. It seems like these two classes ...
|
|
How close can you get to introducing and discharging hypotheses in metamath?
I'm trying to define a symbol formal system for the $\land$-only fragment of classical propositional logic.
It has the ...
|
|
The Natural Number Game suggests the possibility of rewriting mathematics textbooks with embedded interactive Lean code. I'm envisioning something like Google Colab or Mathematica, where you can ...
|
|
...
|
|
When I first learned Haskell, I was told that you use data keyword to define an "algebraic data type", or a "sum type". Then I learned the idea ...
|
|
Lemma sum_square_p : forall n, 6 * sum_n2 n = n * (n + 1) * (2 * n + 1).
where sum_n2 is defined
...
|
