G. Allais
e2d2710504
[ linear ] introduce mapFst, mapSnd ( #3121 )
...
* [ linear ] introduce mapFst, mapSnd
* [ new ] add insertAt, the inverse to lookup
2023-10-27 13:22:13 +01:00
Denis Buzdalov
5f29b0b9c5
[ elab ] Add an ability to inspect in which function we currently are
2023-10-26 15:42:26 +01:00
Denis Buzdalov
50a579fa18
[ elab ] Implement an operation of returning referred defs of a def
2023-10-26 15:42:26 +01:00
Adowrath
ea093ffaed
[ warning ] for incompatible visibilities on forward decls and definitions. ( #3063 )
2023-10-25 11:24:43 +01:00
Denis Buzdalov
305604d243
[ base ] Implement a bunch of standard interfaces for Data.These
( #3117 )
...
* [ base ] Implement a bunch of standard interfaces for `Data.These`
* [ base ] Add couple of eliminators with default values for `These`
2023-10-25 11:15:28 +01:00
Raffi Sanna
4097e6c993
Switch from 'fast' string functions to normal string functions
2023-10-23 12:01:13 +01:00
Raffi Sanna
f694e5e2f0
Use do
notation in some
2023-10-19 08:45:33 +01:00
Denis Buzdalov
6c35157087
[ ux ] Make isType
fail with positioned errors
2023-10-17 18:05:54 +01:00
Denis Buzdalov
f64047b9ac
[ safe ] Set deriving escape hatches to be marked as %unsafe
2023-10-17 18:05:54 +01:00
Denis Buzdalov
2358a74a29
[ base ] Implement Zippable
for several standard types + small cleanup
2023-10-16 22:41:55 +01:00
0xd34df00d
7c8076c149
[ base ] Relevant and irrelevant traversals for Data.Vect.Quantifiers.All
2023-10-16 09:49:22 +01:00
0xd34df00d
f2a95071a1
[ base ] Add Data.Vect.Quantifiers.All.remember
, the inverse to forget
( #3096 )
...
Co-authored-by: Guillaume Allais <guillaume.allais@ens-lyon.org>
2023-10-13 15:26:24 +01:00
Stefan Höck
7fbbb030df
[ new ] add Data.List.grouped function ( #3089 )
2023-10-13 13:48:15 +01:00
Denis Buzdalov
f7d4b7f4ed
[ base ] Add a bridge between MonadState
and Ref
2023-10-13 13:47:31 +01:00
Denis Buzdalov
6815aefbe0
[ elab ] Implement file operations, e.g. applicable for type providers
2023-10-13 13:26:46 +01:00
0xd34df00d
32b639ca3c
[ base ] Prove anyToFin
preserves the property witnessed by Any
2023-10-09 15:03:55 +01:00
0xd34df00d
8d5caaa137
[ base ] Add anyToFin
converting a Vect's Any
to its index
2023-10-09 15:03:55 +01:00
Denis Buzdalov
1256ded110
[ elab ] Implement Ord
for Count
2023-10-04 16:31:38 +01:00
Denis Buzdalov
f3eff838b2
[ perf ] Do not split tree too early
2023-10-01 07:16:20 +01:00
Denis Buzdalov
276d41d86c
[ new ] Implement Sized
for Seq
s
2023-10-01 07:16:20 +01:00
Denis Buzdalov
3886200d29
[ fix ] Make traverse
and friends lazy for LazyList
2023-09-25 19:51:17 +01:00
Denis Buzdalov
6dc06cd67d
[ base ] Add update functions to sorted maps
2023-09-23 22:47:05 +01:00
Joel Berkeley
f6c000e27e
Fix typo in namespace for [bi]traversable composition
2023-09-20 09:15:56 +02:00
Guillaume Allais
b4d7bba550
[ cleanup ] use default
arguments
...
This simplifies most calls to `testsInDir`.
2023-09-07 14:57:22 +01:00
G. Allais
c52b029986
[ new ] function options for case blocks ( #3062 )
2023-09-01 11:35:52 +01:00
Aleksei Volkov
af7ba2fa67
[ ttc ] Compare modification time with nanosecond precision ( #3046 )
2023-08-31 11:55:57 +01:00
Denis Buzdalov
a4ccb27c83
[ base ] Add lists' infix-by functions, complementary to existing ones
2023-08-28 13:53:59 +01:00
Denis Buzdalov
cf9a73f86c
[ prelude ] Add some lacking %tcinline
s
2023-08-23 11:04:53 +01:00
russoul
ebbae42c85
Add uncons' to base; rewrite head' and tail' in terms of uncons'
2023-08-23 11:04:23 +01:00
Marshall Abrams
bdb6531b86
Add documentation for Not.
2023-08-15 20:07:21 -05:00
Steve Dunham
badf1e98c8
[ base ] Make foldr1 and foldr1By public
2023-08-07 08:10:35 +01:00
Robert Wright
3c61471da3
Erase additional PreorderReasoning arguments
2023-08-04 13:37:46 +01:00
Steve Dunham
b481994bef
[ fix ] Fixes build broken by #3021
2023-08-01 08:01:12 +01:00
scarf
c7abb148e8
feat: even and odd for Nat and Integral ( #3021 )
2023-07-31 08:36:40 +01:00
Saransh Chopra
4fcb0fb4a7
Remove decideLTE
( #3031 )
2023-07-27 08:04:24 +01:00
André Videla
a39bfc6ce3
Merge branch 'main' into constant_fin
2023-07-18 23:46:07 +09:00
Steve Dunham
8d7791ba55
[ base ] Add getTermCols and getTermLines to base library and fix pri… ( #3009 )
2023-07-18 09:42:47 -05:00
scarf
388d217757
docs: typo in list difference documentation ( #3018 )
2023-07-16 10:39:36 -05:00
Katarzyna Marek
5fd5b1e732
improvement: use std lib WellFounded
for Sufficient
2023-07-05 16:44:07 +01:00
CodingCellist
18e887389f
[ papers ] Port the first part of "Deferring the details [...]" by Liam O'Connor ( #2974 )
...
Co-authored-by: Guillaume Allais <guillaume.allais@ens-lyon.org>
2023-07-05 16:42:58 +01:00
Robert Wright
754f6af55c
Add orBothFalse proof
2023-07-05 16:36:55 +01:00
Robert Wright
af3c5fd454
Generalize Prelude proof helpers
2023-07-05 16:36:09 +01:00
stefan-hoeck
c1a5be9b5b
[ performance ] make Eq and Ord for Fin run in constant time
2023-07-05 15:58:41 +02:00
Denis Buzdalov
5dcf62499d
[ elab ] Make elab scripts be able to record warnings ( #2999 )
2023-06-19 16:34:19 +01:00
André Videla
9f20ba2609
Merge pull request #2918 from buzden/min-max-gen-for-connex
...
[ new ] Add generalisations of `min` and `max` for `StronglyConnex`
2023-06-16 15:27:06 +01:00
Walter Smuts
98e5615dbc
Typos: change all uses of inferable to inferrable
...
Achieves consistency...
2023-06-08 13:45:57 +02:00
Thomas E. Hansen
009eb270c1
Revert "[ fix ] Rename Prelude.Interface NS Lazy to ILazy"
...
This reverts commit bd231c2076
, which is a
separate thing that should be its own PR.
2023-05-30 09:46:24 +02:00
Thomas E. Hansen
bcbe2b8c4f
[ fix ] Rename Prelude.Interface NS Lazy to ILazy
...
This is required due to `Lazy` now being a reserved compiler primitive.
N.B. This may also break other dependencies and/or tools. Notably stuff
outwith the Idris2 upstream. There's been some discussion in #2987 .
2023-05-30 09:46:24 +02:00
Denis Buzdalov
91b7aafb74
[ base ] Add generalisations of min
and max
for StronglyConnex
2023-05-15 19:15:36 +03:00
Aleksei Volkov
298f91cf0a
[ base ] Implemented Ord
for Name
, Namespace
and UserName
( #2973 )
2023-05-15 14:45:42 +01:00