-
It would be nice to be able to define new symbols at the REPL, like this:
```
:let timesTwo x = x * 2
:let double x = x + x
:prove \x = timesTwo x == double x
```
Yes, this could be done with lots o…
-
Defining modalities to be records (or classes) forces them to fix a particular universe level, even though any actual definition of a modality is universe polymorphic. This causes problems if, for in…
-
_From [fra...@gmail.com](https://code.google.com/u/108596877348066494139/) on January 10, 2011 13:04:03_
We want to parse Prover9 proofs into gapt. This should be based on the textual proofs that Pro…
-
https://github.com/jats-ug/translate/issues/1 から移動
-
To keep things a little separated, I'll open a new issue from this (this is continued from #356).
It would be nice to have a more powerful tactic like Coq's `simp`. The main purpose for me (currently…
-
Various parts of the game engine "rely" on being able to tell whether Thangs contain or intersect each other, or how far away their nearest edges are. Thangs are either ellipses or rectangles, and may…
-
When running the following file
```
import logic.core.eq
open eq eq_ops
definition rec_on2 {A : Type} {a a' : A} {B : Πa' : A, a = a' → Type} (H1 : a = a') (H2 : B a (refl a)) : B a' H1 :=
eq.rec (λ…
-
# SESSION: Technical Presentations 2
## Integrating approaches for feature implementation
Benjamin Behringer
Pages: 775-778
doi>10.1145/2635868.2666605
Full text: PDFPDF
Compositional and annotative…
-
- Based on Rust syntax
- Extensible syntax through intrinsics
- Potential for dependently typed
- Run time reflection
- Easy to integrate with Rust
I have not thought of syntax of operator precedence…
-
Reported by **till** and assigned to **eugenk**
Migrated from http://trac.informatik.uni-bremen.de:8080/hets/ticket/972
---