-
I will describe the problem of converting locally nameless proofs to named ones. I need to clarify that for myself, and I also need a place to refer to.
In our setting, the named proof system has a…
-
Modern SMT solvers can reason modulo a large number of theories, including the theory of quantifiers. Hence, they can also solve first-order problems (although the proof search is usually incomplete)…
-
Hi everyone,
I'm currently trying to understand the theory of computation of GLMMs. Are there some algorithms available (close to the current implementation) for the case "nAGQ=0"?
Also, where c…
-
Currently, hs-to-coq uses Program Fixpoint to deal with more complex termination arguments. However, this makes it extremely hard to work with the resulting code, since Program Fixpoint creates huge p…
-
Most of the time spent constructing a Sapling transaction is spent constructing `Spend` proofs. In theory we could compute these in advance, though the proofs would "fall behind" as the accumulator gr…
-
Elementary discrete mathematics for computer science and engineering. Emphasis on mathematical definitions and proofs as well as on applicable methods. Topics include formal logic notation, proof meth…
-
In the following proof, `alectryon AlectryonIssue.v --backend latex` builds a document where the variable `z` is presented as a simple declaration `z: nat` and not `z := Nat.max x y : nat`, which ma…
-
Moved from Vector's issue here's the current state of early classic
All of the remakes pre 9a should be redone for sure
The 4 remakes that transition from pc to c have multiple names according to …
-
Reported by **maeder** and assigned to **maeder**
Migrated from http://trac.informatik.uni-bremen.de:8080/hets/ticket/137
---
- One emacs with spec and proof buffer
- Reload button should rebuild bu…
-
# Analytic Gaussian Process Analysis Framework
1. Kernel Representation Module
- Implement your exact form of the kernel for the Hardy Z-function
- Generalize to handle other analytic kerne…