iiinova — where your digital self keeps evolving

orpheee.bsky.social @orpheee.bsky.social · 26/01/2026

these days i’ve been finding lots of gems

orpheee.bsky.social @orpheee.bsky.social · 19/01/2026

browsing r/indieheadscirclejerk, as one does, i found a post about essentials from /mu/ (the 4chan board?!), then browsed and found a subgenre of "experimental": "plunderphonics", with this being the first album of the list i found on apple music, and instantly loved it. i need to do this more often

Aethernet
. . . . . . . .
Artist Fax Gang
Type Album
Released 1 January 2021
RYM Rating 3.13 / 5.0 from 3,558 ratings
Ranked #1,455 for 2021
Genres
HexD, Cloud Rap, Electropop
Wave, Experimental Hip Hop, Bitpop

Descriptors
noisy, dense, androgynous vocals, ethereal, melodic, sad, futuristic, introspective, LGBTQ, hypnotic, atmospheric, alienation, bittersweet, melancholic, existential, rhythmic, energetic, love, female vocalist, nocturnal, lo-fi, cold, nonbinary vocalist, cryptic, breakup, muffled, transgender, progressive

Language English

040 0

orpheee.bsky.social @orpheee.bsky.social · 22/12/2025

im afraid that not one bsky feed gives me such high quality slop, i yearn for the algorithm

000 0

orpheee.bsky.social @orpheee.bsky.social · 08/12/2025

lmao i want to meet someone like this

010 0

orpheee.bsky.social @orpheee.bsky.social · 04/12/2025

the artist: 👨🏼‍🦲, the art:

husband and wife wedding cartoon with the face replaced with bald guy emoji and the wife with a screenshot of “top album i love my computer 2598 minutes”

010 0

orpheee.bsky.social @orpheee.bsky.social · 27/11/2025

QUE BUENA QUE BUENA QUE BUENAAAAAAAAAAAAAAA

010 0

orpheee.bsky.social @orpheee.bsky.social · 12/11/2025

deleted my cryptography class virtual machines accidentally :(((

photorec output, searching deleted files

000 0

orpheee.bsky.social @orpheee.bsky.social · 02/11/2025

don’t wanna be too much of a hater why is “chestertons fence” even a thing???? pbs.twimg.com/media/G4sh8t...

010 0

orpheee.bsky.social @orpheee.bsky.social · 13/10/2025

i did it this way because apparently that’s how some tex package does it, but my lib also has an indented display option:

gh issue showing a feature request with sample output from latex

020 0

orpheee.bsky.social @orpheee.bsky.social · 28/09/2025

told friend about bad movie i saw, and before i started ranting he said “oh, was there forced inclusion?“ 😭😭

Guy On Doomed Planet Mostly Concerned With Skin Color Of
People In Movies
© the ONION

030 0

orpheee.bsky.social @orpheee.bsky.social · 12/09/2025

haskell, of course! lean, in second place, havent been able to write much of it

081 0

orpheee.bsky.social @orpheee.bsky.social · 27/08/2025

read the first line and immediately screamed of laughter TRULY AMAZING

Jonathan Blow on Rust Okay, but if I use 'unsafe everywhere, then I de facto don't have memory safety. Why, then should I use Rust and pretend like I am getting memory safety? Why wouldn't I use a lower- friction language with a faster compiler? It looks to me like
the Rust community has this weird way of wanting to have its

5394 0

orpheee.bsky.social @orpheee.bsky.social · 20/08/2025

i also had this anxiety… i miss my dad

“ They were keenly aware that I was now their only parent, and
Willa, my youngest, obsessed about it, asking, "If you
"If you die, how are people going to know how to find us?" It was almost a year before I could go out at night without the kids' going into a panic. When I forced myself to make a few tentative forays into the world, within an hour there would be a phone call and I'd be on my way
back home.”

100 0

orpheee.bsky.social @orpheee.bsky.social · 01/08/2025

'i have very niche interests', my interests:

screenshot of a popular youtuber, with many followers on bsky

020 0

orpheee.bsky.social @orpheee.bsky.social · 01/08/2025

famously, zig is a dependently typed language

$fn binaryOP(self: *VM, comptime interT: type, comptime mkValue: fn (interT) Value, comptime op: fn (f64, f64) interT) ?InterpretResult { if (!self.peek(0).isNumber() or !self.peek(1).isNumber()) { self.runtimeError("Operands must be numbers.", .{}); return .RUNTIME_ERR; } const b = self.pop().number; const a = self.pop().number; self.push(mkValue(op(a, b))); return null; }$

150 0

orpheee.bsky.social @orpheee.bsky.social · 22/07/2025

lol i experienced the same thing but with interestellar imax, literally the meme:

oppenheimer imax meme (distorted face due to front row seating)

010 0

orpheee.bsky.social @orpheee.bsky.social · 21/07/2025

why not name instances and use them explicitly as arguments like in lean?

100 0

orpheee.bsky.social @orpheee.bsky.social · 15/07/2025

lmaooo my stupid ass thought haskell's `$` was ONLY present as `<|` in lean so i had to type that everywhere, but then i copy-pasted a bunch of haskell code with `$` and there weren't any errors lololol, i confused, press 'go to definition' AND THERE IT WAS `$` for function application in lean

/--
Alternative syntax for `<|`. `f $ x` means the same as the same as `f x`,
except that it parses `x` with lower precedence, which means that `f $ g $ x`
is interpreted as `f (g x)` rather than `(f g) x`.
-/
-- Note that we have a whitespace after `$` to avoid an ambiguity with antiquotations.
syntax:min term atomic(" $" ws) term:min : term

macro_rules
| `($f $args* $ $a) =>
if a.raw.isMissing then
-- Ensures that `$f $args* $` is elaborated as `$f $args*`, not `$f $args* sorry`.
-- For the latter, the elaborator produces `TermInfo` where the missing argument has already
-- been applied as `sorry`, which inhibits some language server functionality that relies
-- on this `TermInfo` (e.g. signature help).
-- The parser will still produce an error for `$f $args* <|` in this case.
`($f $args*)
else
`($f $args* $a)
| `($f $ $a) =>
if a.raw.isMissing then
`($f)
else
`($f $a)

unsafe def primEnv : EnvCtx LispVal :=
Std.TreeMap.ofArray
#[
("+", mkF $ binopFold (numOp (.+.)) (.number 0) )
, ("*", mkF $ binopFold (numOp (.*.)) (.number 1) )
, ("string-append", mkF $ binopFold (strOp (.++.)) (.string ""))
, ("-", mkF $ binop $ numOp (.-.))
, ("<", mkF $ binop $ numCmp (.<.))
, ("<=", mkF $ binop $ numCmp (.<=.))
, (">", mkF $ binop $ numCmp (.>.))
, (">=", mkF $ binop $ numCmp (.>=.))
, ("==", mkF $ binop $ numCmp (.==.))
, ("even?", mkF $ unop $ numBool (even))
, ("odd?", mkF $ unop $ numBool odd)
, ("neg?", mkF $ unop $ numBool (.< 0))
, ("pos?", mkF $ unop $ numBool (.> 0))
, ("eq?", mkF $ binop eqCmd )
, ("null?", mkF $ unop (eqCmd .nil) )
, ("bl-eq?", mkF $ binop $ eqOp (.==.))
, ("and", mkF $ binopFold (eqOp (.&&.)) (.bool .true))
, ("or", mkF $ binopFold (eqOp (.||.)) (.bool .false))
, ("not", mkF $ unop notOp)
, ("cons", mkF Prim.cons)
, ("cdr", mkF Prim.cdr)
, ("car", mkF Prim.car)
, ("quote", mkF quote)
, ("file?", mkF $ unop fileExists)
, ("slurp", mkF $ unop slurp)
-- , ("wslurp", mkF $ unop wSlurp)
, ("put", mkF $ binop put)
]

120 0

orpheee.bsky.social @orpheee.bsky.social · 14/07/2025

CAN YOU SPOT THE DIFFERENCE? I SPENT HALF AN HOUR WONDERING WHAT WAS HAPPENING AAAAAAA

unsafe instance : ToString LispVal where
toString v := Std.Format.pretty <| showVal v

unsafe abbrev LispVal.toString (v : LispVal) : String
:= toString v

unsafe instance : ToString LispVal where
toString v := Std.Format.pretty <| showVal v

unsafe abbrev LispVal.toString (v : LispVal) : String
:= ToString.toString v

140 0

orpheee.bsky.social @orpheee.bsky.social · 12/07/2025

most mutual recursion definitions work fine, though after experimenting i found out that there are many restrictions (same number of type args in mutual types, either only abbrevs & defs or only inductive & structure declarations). i didn't really need it though

import Std.Data.TreeMap

namespace Wyasl.LispVal

def EnvCtx a := Std.TreeMap String a

def Eval a := ReaderT (EnvCtx a) IO a

def Func a := List a -> Eval a

inductive LispVal where
| atom : String -> LispVal
| list : List LispVal -> LispVal
| number : Int64 -> LispVal
| string : String -> LispVal
| fn : Func LispVal -> LispVal
| lambda : Func LispVal -> EnvCtx LispVal -> LispVal
| nil : LispVal
| bool : Bool -> LispVal

unsafe def showVal : LispVal -> Std.Format
| .atom a => .text a
-- TODO: intersperse .list
| .list a => "(" ++ List.foldl (fun x y => x ++ " "++ showVal y) "" a ++ ")"
| .number a => repr a
| .string a => repr a
| .fn _ => "(internal function)"
| .lambda _ _ => "(lambda function)"
| .nil => "Nil"
| .bool a =>
match a with
| true => "#t"
| false => "#f"
end Wyasl.LispVal

110 0

orpheee.bsky.social @orpheee.bsky.social · 12/07/2025

half an hour fighting with lake just cause the author didn't add a version to the package (???) and i confused the lean version builds on reservoir with the actual package version...

☰

Readme
Versions (1)
Dependencies (2)
Dependents (3)

fgdoraisParser
Parser Combinator Library for Lean 4
METADATA

Apache 2.0
3 days ago

53 stars

LEAN

v4.22.0-rc3
v4.22.0-rc2
v4.21.0
v4.21.0-rc3
v4.20.1
v4.20.0
v4.20.0-rc5
v4.20.0-rc2
v4.19.0
v4.19.0-rc3

47 more

REPOSITORY
fgdorais/lean4-parser
Lean 4 / Parser

A parser combinator library for Lean 4.

010 0

orpheee.bsky.social @orpheee.bsky.social · 12/07/2025

i have been looking for how to do this the 'safe' way for 6hrs. after giving up it took me yet more time to figure out i could put just 'unsafe' there

040 0

orpheee.bsky.social @orpheee.bsky.social · 11/07/2025

Turns out baby-covered albums are very good

010 0

orpheee.bsky.social @orpheee.bsky.social · 11/07/2025

i've had this image in my desktop for months now

000 0

orpheee.bsky.social @orpheee.bsky.social · 06/07/2025

lean lang has simps, confirmed ‼️‼️

95 #eval·fifth·[1,2,3,4,5]⏎ 5
96 │·(by·simp)⏎
┌────────────────────────────────────────────────────────────────────────────────────────────────┐
│ ▌
│ The simp tactic uses lemmas and hypotheses to simplify the main goal target or ▌
│ non-dependent hypotheses. It has many variants: ▌
│ ▌
│ • simp simplifies the main goal target using lemmas tagged with the attribute [simp]. │
│ • simp [h₁, h₂, ..., hₙ] simplifies the main goal target using the lemmas tagged │
│ with the attribute [simp] and the given hᵢ's, where the hᵢ's are expressions.- │
│ • If an hᵢ is a defined constant f, then f is unfolded. If f has equational lemmas associated │
N│

010 0

orpheee.bsky.social @orpheee.bsky.social · 05/07/2025

Did you know that haskell's 'time' library works just fine on wasm? (forgive me for the imprecise floating point arithmetic...) It's live here! 0rphee.github.io/xolsh/

$Haskell code of a lox interpreter compiled to wasm interpret :: Vector Stmt.Stmt2 -> IO Error.ErrorPresent interpret statements = do globalsRef <- newIORef M.empty writeIORef globalsRef $ globals globalsRef let initialInterpreterState = InterpreterState { environment = GlobalEnvironment globalsRef , globals = globalsRef } value <- State.evalStateT (runExceptT $ executeStmts statements) initialInterpreterState case value of Left e -> Error.reportRuntimeError e >> pure Error.Error Right () -> pure Error.NoError where globals globalsRef = M.fromList [ ( "clock" , Expr.LCallable $ Expr.CFunction $ Expr.LRFunction { Expr.fun_toString = "<native fn>" , Expr.fun_arity = 0 , Expr.fun_closure = GlobalEnvironment globalsRef , Expr.fun_isInitializer = False , Expr.fun_call = \_evaluator _args -> -- realToFrac & fromIntegral treat NominalDiffTime as seconds Expr.LNumber . realToFrac <$> liftIO Time.getPOSIXTime } ) , ( "read" , Expr.LCallable $ Expr.CFunction $ Expr.LRFunction { Expr.fun_toString = "<native fn>" , Expr.fun_arity = 0 , Expr.fun_closure = GlobalEnvironment globalsRef , Expr.fun_isInitializer = False , Expr.fun_call = \_evaluator _args -> liftIO $ readByte stdin } )$ Lox wasm interpreter with editor online, with the result:

Fibonacci of
29
results in:
514229

Factorial of
29
results in:
8841761993739701000000000000000

total time (seconds)
5.6600000858306885

Lox wasm interpreter with editor online, with the result:

Fibonacci of
29
results in:
514229

Factorial of
29
results in:
8841761993739701000000000000000

total time (seconds)
5.6600000858306885

070 0

orpheee.bsky.social @orpheee.bsky.social · 03/07/2025

a person i know, posted this on ig:

red j peterson in the style of vision from marvel

000 0

orpheee.bsky.social @orpheee.bsky.social · 30/06/2025

if people studied philosophy rigorously, not even a clown would dare to mention yarvins name in any context whatsoever

guy on twitter saying yarvin is mid, expected an intelectual to be better

010 0

orpheee.bsky.social @orpheee.bsky.social · 30/06/2025

the middle class doesn’t know anything about vegetarianism apparently

010 0