camoy

#lang effect/racket

;;
;; require
;;

(unsafe-require "aux.rkt")

;;
;; 0 (introduction)

camoy

#lang racket

(require (for-syntax racket/base
                     syntax/id-table
                     syntax/parse
                     syntax/parse/lib/function-header))
(module+ test (require rackunit))

(begin-for-syntax
  (define raw-sc (make-syntax-introducer))

camoy

#lang racket

(provide
 (contract-out
  [remember/c (-> (-> any/c any/c) chaperone-contract?)]))

(require meta)
(module+ test (require rackunit))

(define (remember/c convert)

camoy

#lang racket

(provide
 (contract-out
  [canonicalize/c
   (-> (-> any/c any/c) contract?)]))

(module+ test (require rackunit))

(define (canonicalize/c convert)

camoy

Primality tests like the Fermat test and the Miller-Rabin test rely on so-called "witnesses." In the case of Fermat, if a^{p-1} = 1 (mod p), for some a, then p is probably prime. The a is called a Fermat witness. However, if a composite passes the test for a given a, then a is called a Fermat liar. The same principle holds for Miller-Rabin, although the equation is slightly more complicated.

Which numbers are the most honest? Which ones are the most lying? Run racket main.rkt to produce a bunch of heat maps that show the most honest (dark) and most lying (bright) numbers. This one shows for the numbers 2 to 1024:

camoy

#lang racket/base

;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
;; provide

(provide violin)

;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
;; require

camoy

#lang racket/base

(require racket/contract)

(define must-return/c
  (make-contract
   #:name 'must-return/c
   #:late-neg-projection
   (λ (blm)
     (λ (f neg)

camoy

let with_return f x =
  let r = ref None in
  try
    f (fun v -> r := (Some v); raise Not_found) x
  with _ ->
    match !r with
    | None -> raise Not_found
    | Some x -> x

let til_first_even =

camoy

(define-values (success-tag fail-tag)
  (values (make-continuation-prompt-tag 'success)
          (make-continuation-prompt-tag 'fail)))

(define-syntax amb
  (syntax-rules ()
    [(_ alt ...)
     (call/comp
      (λ (k)
        (abort

camoy

;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;

(define (assert pred)
  (or pred (amb)))

(define amb-queue (make-parameter #f))
(define amb-escape (make-parameter #f))

(define-syntax-rule (begin-amb fail body ...)
  (let/cc k