How to implement a queue in Golang

package main
import "fmt"
func enqueue(queue[] int, element int) []int {
  queue = append(queue, element); // Simply append to enqueue.
  fmt.Println("Enqueued:", element);
  return queue
}
func dequeue(queue[] int) ([]int) {
  if len(queue) == 0 {
        fmt.Println("Cannot dequeue from an empty queue")
        return queue
  }
  element := queue[0]; // The first element is the one to be dequeued.
  fmt.Println("Dequeued:", element)
  return queue[1:]; // Slice off the element once it is dequeued.
}
func main() {
  var queue[] int; // Make a queue of ints.
  queue = enqueue(queue, 10);
  queue = enqueue(queue, 20);
  queue = enqueue(queue, 30);
  fmt.Println("Queue:", queue);
  queue = dequeue(queue);
  fmt.Println("Queue:", queue);
  queue = enqueue(queue, 40);
  fmt.Println("Queue:", queue);
}

package main
import "container/list"
import "fmt"

func main() {
    // new linked list
    queue := list.New()

    // Simply append to enqueue.
    queue.PushBack(10)
    queue.PushBack(20)
    queue.PushBack(30)

    // Dequeue
    front:=queue.Front()
    fmt.Println(front.Value)
    // This will remove the allocated memory and avoid memory leaks
    queue.Remove(front)
}