We present two systems for rst-order typing of graph expressions, in natural deduction style: conventional typing and (polymorphic) uniqueness typing. In both type systems, typing is preserved during evaluation, and types can be determined eeectively.