is there a more scala-ish way to do this?

gistfile1.txt

  def pow(n:Int , k:Int ) : Int = {

    k match  {
      case  0 => return 1;
      case  1 => return n;
      case 2 => return n*n;
      case _ => ;
    }

    if ( (k%2)==0) {
      var p =
        pow(n,k/2) *
          pow(n,(k+1)/2);
      return p;
    }
    if (k%2==1) {
      var p = pow(n,k/2)
      return p * p;
    }
    0
  }
  def x : Int = 2;
  def y : Int = 4;
  println(pow(x,y))
}