import Base
import ./LAWS.bend as Laws

def Laws.to_list_empty(a, A):
  {==}

def Laws.empty_is_q_nil(a, A):
  {==}

def Laws.to_list_q(a, A, f, r):
  {==}

def Laws.to_list_enqueue_empty(a, A, x):
  {==}

def Laws.enqueue_empty(a, A, x):
  {==}

def Laws.enqueue_q(a, A, f, r, x):
  {==}

def Laws.dequeue_enqueue_empty(a, A, x):
  {==}

def Laws.dequeue_front_cons(a, A, h, t, r):
  {==}

def Laws.dequeue_from_cons(a, A, h, t):
  {==}

def Laws.peek_empty(a, A):
  {==}

def Laws.peek_enqueue_empty(a, A, x):
  {==}

def Laws.peek_from_cons(a, A, h, t):
  {==}

def Laws.length_empty(a, A):
  {==}

def Laws.length_q(a, A, f, r):
  {==}

def Laws.length_enqueue(a, A, f, r, x):
  {==}

def Laws.length_enqueue_empty(a, A, x):
  {==}

def Laws.length_from_list_def(a, A, xs):
  {==}

def Laws.from_list_q(a, A, xs):
  {==}

def Laws.to_list_from_list_def(a, A, xs):
  {==}

def Laws.dequeue_empty(a, A):
  {==}

def Laws.is_empty_empty(a, A):
  {==}

def Laws.is_empty_enqueue_empty(a, A, x):
  {==}

def Laws.is_empty_front_cons(a, A, h, t, r):
  {==}

def Laws.is_empty_from_nil(a, A):
  {==}

def Laws.is_empty_from_cons(a, A, h, t):
  {==}

def Laws.norm_empty(a, A):
  {==}

def Laws.norm_front_cons(a, A, h, t, r):
  {==}

def Laws.norm_rear_singleton(a, A, x):
  {==}