wweic

package main

import (
	"fmt"
)

func a ()[]int {
	var arr [16]int
	for i := range arr {
		arr[i] = i

wweic

type atype = {a : int}
type btype = {a : int; b : int}
let accept {a = x} = x
(*
  ---> val accept : btype -> int = <fun>
  
  select the last record type which contains the fields
*)

wweic

;; A Scheme-to-C compiler.

;; Author: Matthew Might
;; Site:   http://matt.might.net/
;;         http://www.ucombinator.org/

;; The purpose of this compiler is to demonstrate
;; the most direct possible mapping of Scheme into C.
;; Toward that end, the compiler uses only two
;; intermediate transformations: mutable-variable

wweic

#lang racket

; a simple example to deduce Y-combinator for factorial function
; author: Wei Chen([email protected])

; 1. 
; we can use lambda extraction to get reference to self
(define f1 
  (lambda (fac)
    (lambda (x)

wweic

(* Parse a subset of regular expression, using recursive descent *)
(* modified from https://code.google.com/p/sharable-stuff/ *)

type regexp = 
  | Empty_String
  | Char of char
  | Union of regexp * regexp
  | Concat of regexp * regexp
  | Star of regexp

wweic

#lang scheme
;; notes about Y combinator and related.

;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
;; function never stop
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
(define eternity
  (lambda (x)
    (eternity x)))

wweic

#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>