-
Consider this example:
```coq
Axiom string : Set.
Axiom Z : Set.
Axiom z : Z.
Inductive expr :=
| Var (x : string)
| Lam (x : string) (e : expr)
| App (e1 e2 : expr)
| LitInt (n: Z)…
-
Based off some [still unpublished but available research](http://arxiv.org/abs/2406.13030) by @paulromano et al., there could be substantial savings in the way that we evaluate point-in-volume for ini…
-
Naproche doesn't allow infix notation for functions.
Examples:
- `Definition. Let a,b be objects and f be a function. Assume that (a,b) is an element of Dom(f). a f b = f[(a,b)].`
- `Let a f b …
-
In Haskell, a function can be called in an infix position, such as `arg1 func arg2`, by surrounding the function name with backticks. I'm not a big fan of Haskell's particular syntax for infix notatio…
-
We have Behavior#map but also `filterApply`, `when`, etc that are prefix. Uniformity is the biggest issue, but I prefer the infix notation, and would prefer it everywhere where possible.
-
A combination of implicit wrapper, type parameter, typetag, and infix notation causes an issue:
bad:
`val localPort = config getOption[Boolean] "local-port-header" collect {`
ok:
`val localPort = …
-
In the Input Section User will enter an Infix Expression and in the button section there should be two buttons with label prefix and post fix. On clicking prefix the infix expression should be changed…
Ctoic updated
12 months ago
-
https://en.wikipedia.org/wiki/Reverse_Polish_notation
This is algorithm used to understand work of processor and manipulation with stack
Reinvented by Dijkstra
-
I'd like to be able to use `+` and `-` for `Int.add` / `Int.sub`, and `++` for list append, etc. Presumably there needs to be some notation of (user-extensible) scoping, perhaps ideally with the abil…
-
```
The language used for expressions is in non user-friendly prefix notation.
Should this be changed to infix notation?
```
Original issue reported on code.google.com by `joel.hak...@mtm.se` on 21 …