Paul Reichert 3695059504 feat: introduce MonadLiftT Id m (#8977) ... This PR adds a generic `MonadLiftT Id m` instance. We do not implement a `MonadLift Id m` instance because it would slow down instance resolution and because it would create more non-canonical instances. This change makes it possible to iterate over a pure iterator, such as `[1, 2, 3].iter`, in arbitrary monads.		2025-06-26 07:33:07 +00:00
..
Classes	chore: remove unused simp args (#8905)	2025-06-20 22:34:30 +00:00
Data	feat: introduce MonadLiftT Id m (#8977)	2025-06-26 07:33:07 +00:00
Internal	feat: monadic interface for asynchronous operations in Std (#8003)	2025-06-26 02:51:26 +00:00
Net	feat: add network interfaces (#7578)	2025-03-24 17:57:05 +00:00
Sat	chore: remove unused simp args (#8905)	2025-06-20 22:34:30 +00:00
Sync	chore: fix spelling mistakes (#8324)	2025-05-14 06:52:16 +00:00
Tactic	chore: Revert "feat: Upstream MPL.SPred.* from mpl" (#8927)	2025-06-22 09:02:54 +00:00
Time	chore: remove unused simp args (#8905)	2025-06-20 22:34:30 +00:00
Classes.lean	feat: tree map data structures and operations (#6914)	2025-02-11 14:47:47 +00:00
Data.lean	feat: minimal iterator library (#8358)	2025-05-20 14:53:57 +00:00
Internal.lean	feat: implement basic async IO with timers (#6505)	2025-01-13 18:11:04 +00:00
Net.lean	feat: Std.Net.Addr (#6563)	2025-01-09 09:33:03 +00:00
Sat.lean	feat: Std.Sat.AIG (#4953)	2024-08-12 14:58:38 +00:00
Sync.lean	feat: add Std.SharedMutex (#7770)	2025-04-03 08:30:54 +00:00
Tactic.lean	chore: Revert "feat: Upstream MPL.SPred.* from mpl" (#8927)	2025-06-22 09:02:54 +00:00
Time.lean	chore: fix spelling mistakes (#7328)	2025-04-07 01:15:48 +00:00