chansey97

#lang racket/base
(provide uniq)

;;;
;;; Uniq
;;; 

; The function uniq takes a list as input and returns a new list:
; adjacent elements are compared and omits any repeated elements.
; In other words, uniq works like the Unix utility uniq, but on list.

chansey97

The introduction to Reactive Programming you've been missing

(by @andrestaltz)

---

This tutorial as a series of videos

If you prefer to watch video tutorials with live-coding, then check out this series I recorded with the same contents as in this article: Egghead.io - Introduction to Reactive Programming.

---

chansey97

#include <SWI-Prolog.h>
#include <stdio.h>
#include <stdlib.h>

typedef struct context              /* define a context structure */
{
 int max;
} context;

foreign_t

chansey97

#!/usr/bin/env scheme --script

(import (nanopass))

(define unique-var
  (let ()
    (define count 0)
    (lambda (name)
      (let ([c count])
        (set! count (+ count 1))