Recent public codes are listed below. You can filter them by the following programming languages:
- view
- All
- Ada
- Assembler
- Assembler
- AWK (gawk)
- AWK (mawk)
- Bash
- bc
- Brainf**k
- C
- C#
- C++
- C++0x
- C99 strict
- CLIPS
- Clojure
- COBOL
- COBOL 85
- Common Lisp (clisp)
- D (dmd)
- Erlang
- F#
- Factor
- Falcon
- Forth
- Fortran
- Go
- Groovy
- Haskell
- Icon
- Intercal
- Java
- JavaScript (rhino)
- JavaScript (spidermonkey)
- Lua
- Nemerle
- Nice
- Nimrod
- Objective-C
- Ocaml
- Oz
- Pascal (fpc)
- Pascal (gpc)
- Perl
- Perl 6
- PHP
- Pike
- Prolog (gnu)
- Prolog (swi)
- Python
- Python 3
- R
- Ruby
- Scala
- Scheme (guile)
- Smalltalk
- SQL
- Tcl
- Text
- Unlambda
- VB.NET
- Whitespace
-
1 2 3
let x = 3+4;;
-
1 2 3
?- write('Hello world!'), nl.
-
1 2 3 4 5 6
while true do let n = read_int () in if n = 42 then exit 0; print_int n; print_newline () done;;
-
1 2 3 4 5 6 7
let myfunction w x y z = [w ; x] :: [y; z] ;; type mytype = int*int*int;; type mytype2 = int*int*int;; print_string "hellow world";; print_int ((1,2)[0]);;
-
1 2 3 4 5 6 7
let myfunction w x y z = [w ; x] :: [y; z] ;; type mytype = int*int*int;; type mytype2 = int*int*int;; print_string "hellow world";; print (3, 2);;
-
1 2 3 4 5
let x = (2, "hi") let func x = match x with (y,z) -> y func x
-
1 2 3
let x = (2, "hi") let func x = match x with (y,z) -> y
-
1 2 3 4 5 6
let myfunction w x y z = [w ; x] :: [y; z] ;; type mytype = int*int*int;; type mytype2 = int*int*int;; print_string "hellow world"
-
1 2 3 4 5
let myfunction w x y z = [w ; x] :: [y; z] ;; type mytype = int*int*int;; print_string "hellow world"
-
1 2 3 4 5
let myfunction w x y z = [w ; x] :: [y; z] ;; type mytype = int*int*int print_string "hellow world"
-
1 2 3 4 5
let myfunction w x y z = [w ; x] :: [y; z] ;; print_string "hellow world"
-
1 2 3 4
let myfunction w x y z = [w ; x] :: [y; z] ;;
-
1 2 3 4 5
let myfunction w x y z = w :: x :: [y; z] ;; print_list myfunction 1 2 3 4
-
1 2 3 4 5
let function w x y z = w :: x :: [y; z] ;; print_list function 1 2 3 4
-
1 2 3 4
let function w x y z = [w; x] :: [y; z] ;;
-
1 2 3 4 5 6 7 8 9
(* This is a comment *) let average a b = ( a +. b ) /. 2.0;; let myfunc x = (float_of_int x);; let main () =
-
1 2 3 4 5 6 7
(* This is a comment *) let average a b = ( a +. b ) /. 2.0;; let myfunc x = (float_of_int x);;
-
1 2 3 4 5 6
(* This is a comment *) let average a b = ( a +. b ) /. 2.0;;
-
1 2 3 4 5 6
while true do let n = read_int () in if n = 42 then exit 0; print_int n; print_newline () done;;
-
1 2 3 4 5 6 7 8 9
let isprime k = let rec isprime_helper k factor = match factor with | 1 -> true | _ -> if ((k mod factor) = 0) then false else (isprime_helper k (factor - 1)) in isprime_helper k (truncate(sqrt (float_of_int k)));;
...
-
1 2 3 4 5 6 7 8 9
let isprime k = let rec isprime_helper k factor = match factor with | 1 -> true | _ -> if ((k mod factor) = 0) then false else (isprime_helper k (factor - 1)) in isprime_helper k (truncate(sqrt (float_of_int k)));;
...
-
1
print 1+3*7
-
1
1+2*3;;
-
1
print_endline "Hello World!"
-
1 2 3 4 5 6 7 8 9
class Password { static void Main(string[] args) { console.Write("The password is: ") for (int i = 0; i < 6; i++) Console.Write(GetChar(i,i*i)); Console.readKay();
...
-
1 2 3 4
let rec factorielle = function 0 -> 1 | n -> n * factorielle (n - 1) ;;
-
1 2 3 4
let rec factorielle = function 0 -> 1 | n -> n * factorielle (n - 1) ;;
-
1 2 3 4 5
let rec factorielle = function 0 -> 1 | n -> n * factorielle (n - 1) ;; factorielle(4)
-
1 2 3 4 5
let rec factorielle = function 0 -> 1 | n -> n * factorielle (n - 1) ;; factorielle(4)
-
1 2 3 4 5
let rec fact = function 0 -> 1 | n -> n*fact(n-1);; fact(4);;


