Schemik is a high-level lexically-scoped implicitly-parallel dialect of Scheme and Common LISP, this means the parallel execution of programs is done independently of the programmer and each program written in Schemik always produces the same results no matter which parts of the program are executed simultaneously.

Despite the fact that Schemik is available under the terms of open source license, its development is closed. This means, publicly available release may not entirely conform to software as described in published papers. For certain reasons it may lack some features or some features may be implemented differently. If you have any questions or comments in regard to Schemik, feel free to contact me. (krajcap (at) inf.upol.cz)

Screenshots

Comparison with other interpreters

Schemik

Guile

MzScheme

TinyScheme

MiniScheme

fib

4.40

2.46

1.67

34.08

22.09

fibfp

5.52

3.74

3.58

36.70

failed

fibc**

3.68

31.12

12.68

4.99

2.97

sum

4.16

2.84

1.42

39.35

24.73

sumfp

5.57

4.04

3.59

39.21

failed

tak

3.55

2.23

0.77

24.62

14.95

ctak**

1.26

4.12

5.33

0.72

0.44

cpstak

4.82

3.64

2.63

31.05

19.03

bubblesort*

3.78

1.89

3.97

19.27

1351.72

combi1**

2.04

2.54

2.24

403.74

3385.88

combi2*

3.69

4.08

3.08

1537.85

10543.81

hanoi

2.79

0.87

1.24

5.74

4.01

mazefun

3.84

2.21

1.32

27.68

8.58

nqueens

2.42

0.78

0.44

9.53

7.80

primes

4.98

2.34

1.90

27.25

21.29

permut*

5.47

7.27

4.63

1274.10

14821.43

powerset**

5.10

7.59

5.59

2683.20

21133.95

quicksort*

3.79

5.20

1.56

1967.83

> 17 hrs

Each number represents time (in seconds) it takes to execute the given program.