prim.rkt

#lang racket/base
; (require racket/math)
(provide (all-defined-out))

;; Primitives for the ai-scheme interpretation.

;; Pure functional
(define (p_add a b) (+ a b))
(define (p_sub a b) (- a b))
(define (p_mul a b) (* a b))

(define (p_band a b) (bitwise-and a b))
(define (p_bor  a b) (bitwise-ior a b))
(define (p_bxor a b) (bitwise-xor a b))

(define (p_and a b) (and a b))
(define (p_or  a b) (or  a b))

(define (p_not a)   (if a 0 1))


(define (p_div a b)
  ;; Allow for division by zero.
  (if (zero? b)
      +inf.0
      (/ a b)))
(define (p_pow a b) (expt a b))


(define (p_mod a b)  (remainder a b))
(define (p_quot a b) (quotient a b))

(define (p_sal a b) (arithmetic-shift a b))
(define (p_sar a b) (arithmetic-shift a (- b)))


(define (p_floor x) (floor x))

;; DSL truth values are bitmasks.
(define (p_lt a b)   (if (< a b) -1 0))

(define (p_if c a b) (if (zero? c) b a))


(define (p_exp x) (exp x))
(define (p_sin x) (sin x))
(define (p_cos x) (cos x))
(define (p_log x) (log x))

(define (p_atan x) (atan x))

(define (p_copy x) x)

(define (p_debug x)
  (display (format "~a\n" x) (current-error-port))
  x)