#import "../typst-prooftree/prooftree.typ": *

#let Fix = "Fix"
#let fix = "fix"
#let Proc = "Proc"
#let Act = "Act"
#let Even = "Even"
#let compq = $"comp"_Q$
#let CCS = "CCS"
#let fi = "if"
#let then = "then"
#let def = $=^"def"$
#let ended = $arrow.not$
#let tab = h(2em)
#let seq = "seq"
#let wnu = $without {nu}$
#let wnup = $without {nu'}$
#let wL = $without L$
#let cr = $space cal(R) space$
#let atrans = $->^alpha$
#let awtrans = $=>^alpha$
#let ttrans = $->^tau$
#let ntrans = $->^nu$

#let hml(it) = $bracket.l.double it bracket.r.double$
#let hmlr(it) = $bracket.l.double it bracket.r.double_eta$
#let comp(it) = $bracket.l.double it bracket.r.double_"comp"$
#let ang(it) = $angle.l it angle.r$
#let sat(left, right) = $left tack.r.double right$