Leonardo de Moura
78317c5062
chore(library/init/control/combinators): remove dead notation
2018-09-12 17:34:25 -07:00
Leonardo de Moura
afd54039ab
chore(library): remove >>, we should use *>
2018-09-12 17:31:21 -07:00
Leonardo de Moura
9e305a5f26
chore(library): remove return, we should use pure
2018-09-12 16:51:11 -07:00
Leonardo de Moura
da2de33245
fix(library/init/io): move coroutine_io implementation to io
2018-09-06 18:09:32 -07:00
Sebastian Ullrich
de9d894c14
feat(library/init/lean/parser/reader): use coroutine on the module level
2018-08-29 16:42:24 -07:00
Leonardo de Moura
7a47406c4c
chore(library/tactic): remove simp_lemmas
2018-08-23 14:10:36 -07:00
Leonardo de Moura
c7cf75508d
feat(init/control/coroutine): avoid mutual inductive
...
Reason: we want to delete the inductive compiler.
2018-08-23 10:49:40 -07:00
Sebastian Ullrich
3516c37ec9
feat(library/init/control/coroutine_io): coroutine_io
2018-08-21 08:43:10 -07:00
Sebastian Ullrich
6b55e24ab7
feat(library/init/{io,control/except}): use lift_t to automatically upcast io and other errors
2018-08-21 08:43:09 -07:00
Sebastian Ullrich
a260bf91d4
refactor(library/vm/vm_io,library/system/io): remove io classes, make errors explicit
2018-08-21 08:43:09 -07:00
Leonardo de Moura
8a96fde229
feat(library/init/control/coroutine): add coroutine
...
Remark: the termination proofs are commented because Lean 4 is
currently ignoring them and accepting non-terminating functions.
These files are based on an experiment implemented using Lean 3.
We can find it here:
https://gist.github.com/leodemoura/f5d82426c105b5fae0880e77024f6e9c
We will use coroutines to implement the interaction between reader,
elaborator and main driver.
2018-08-12 17:14:02 -07:00
Sebastian Ullrich
ea2bed7481
feat(library/init/control/combinators): make more universe polymorphic (for e.g. io)
2018-07-30 10:38:00 -07:00
Leonardo de Moura
c7762d07c1
feat(library/init/control/lift): add comment
2018-07-26 15:52:47 -07:00
Sebastian Ullrich
4e2234fd3a
feat(library/init/control/state): remove monad_state.lift to avoid allocating tuples
2018-06-28 09:56:26 +02:00
Sebastian Ullrich
51d3ff21eb
feat(library/init/control/state): monad_state: add specialized MonadState methods + modify
...
Absent inlining, these may perform better than `lift` when e.g. used with an
implementation based on unboxed tuples
2018-06-19 13:01:15 +02:00
Sebastian Ullrich
0f7c0ac8bf
feat(init/lean/parser/parser): make a monad transformer
...
Also move parser combinators into the more specific namespace `init.lean.parser.parser_t`.
2018-06-04 12:57:23 +02:00
Leonardo de Moura
032a101262
chore(*): remove more files
...
@kha I'm trying to remove as much as possible before I start
modifying `expr`
2018-05-21 06:42:58 -07:00
Sebastian Ullrich
bba55aad47
feat(library/init/lean/trace): implement conditional tracing via good old trace classes
2018-05-18 14:52:15 +02:00
Leonardo de Moura
fbac1d45a3
refactor(library/init/control/combinators): move nat.mrepeat to combinators
2018-05-13 11:34:39 -07:00
Leonardo de Moura
8a6d2125b3
chore(library/init/control/combinators): remove top-level mmap and related combinators
...
The top-level `mmap` should use the `traversable` typeclass that will be
defined in the future.
2018-05-09 15:49:13 -07:00
Leonardo de Moura
014735e498
feat(library/init/control/combinators): remove unnecessary universe constraint from list.mmap'
...
This commit also adds the alias `mfor` for `mmap'`
2018-05-09 15:38:35 -07:00
Leonardo de Moura
83415ea44c
feat(library/init/control/except): add instance has_monad_lift (except ε) (except_t ε m)
2018-05-09 12:19:44 -07:00
Leonardo de Moura
874f9caf13
feat(library/init/control/state): modify monad_run instance for state_t
...
@Kha, I was having to use `(run ...).1` in many places
in my code. So, I changed the instance
```
instance (σ m out) [monad_run out m] : monad_run (λ α, σ → out (α × σ)) (state_t σ m) :=
⟨λ α x, run ∘ (λ σ, x.run σ)⟩
```
to
```
instance (σ : Type u) (m out : Type u → Type v) [functor m] [monad_run out m] : monad_run (λ α, σ → out α) (state_t σ m) :=
⟨λ α x, run ∘ (λ σ, prod.fst <$> (x.run σ))⟩
```
If we want to get the resultant state in an action `act`, we can just
use `run (act >> get) init_state`.
2018-05-08 17:32:54 -07:00
Leonardo de Moura
4f75e49da8
feat(library/init/control/except): add monad_except _ except instance
2018-05-08 15:38:20 -07:00
Leonardo de Moura
e40f37b08e
feat(library/init/lean/ir): add type checker
2018-05-07 18:07:04 -07:00
Leonardo de Moura
d5fe509c36
chore(*): remove end after each match-expression
...
`end` is not optional anymore
2018-05-04 11:30:06 -07:00
Leonardo de Moura
2cb6af9769
refactor(library/init/control): remove init.meta.name spurious dependency
2018-04-30 11:36:07 -07:00
Leonardo de Moura
9efd07d18c
chore(library/init): move logic.lean => core.lean
2018-04-30 09:25:25 -07:00
Leonardo de Moura
13ba9ca176
feat(library/init/control/except): add has_repr and has_to_string instances
2018-04-27 13:39:19 -07:00
Leonardo de Moura
77d3a788e8
refactor(init): init/category ==> init.control
2018-04-27 08:33:08 -07:00
