id it : ∀ {A : Set} → A → A
id x = x
it = id

k drop : ∀ {A B : Set} → A → B → A
k x _ = x
drop = k

open import Agda.Builtin.Nat

test : Nat
test = id 42
     + it 42
     + k 42 0
     + drop 42 0
{-# COMPILE AGDA2LAMBOX test #-}
Debug λ☐ Rocq
  ↪  
WASM C OCaml CakeML Rust Elm
  ↪  
  ↪