Welcome to DrRacket, version 6.8 [3m].
Language: racket, with debugging; memory limit: 128 MB.
> 1
1		// numere
> 1/2
1/2		// fracții
> #t
#t		// booleeni
> #f
#f
> 'a
'a		// literali (simboliuri)
> 'abbsac-ce#@#%@aa
'abbsac-ce#@#%@aa
> abc
. . abc: undefined;
 cannot reference an identifier before its definition
> 'abc
'abc
> (quote abc)
'abc
> (+ 1 2)
3
> (+ 1 2 3 4)
10
> (cons 1 2)
'(1 . 2)		// pereche
> '(1 . 2)
'(1 . 2)
> (cons 1 'abc)
'(1 . abc)
> (cons 1 (cons 2 3))
'(1 2 . 3)
> (cons (cons 'a 'b) (cons 2 3))
'((a . b) 2 . 3)
> null
'()
> (cons 'a '())
'(a)			// listă
> (cons 'b (cons 'a '()))
'(b a)			// lista este o serie de perechi imbricate unde ultimul element este lista vidă
> (list 1 2 3 4 5)
'(1 2 3 4 5)
> (car (list 1 2 3 4 5))
1
> (cdr (list 1 2 3 4 5))
'(2 3 4 5)
> (car (cons 1 2))
1
> (cdr (cons 1 2))
2
> (cdr (list 1 2))
'(2)
> (car (list 1 2))
1
> '()
'()
> '(1 2 3)
'(1 2 3)
> '(a . (1 2 3 (5 . 6) + bbbb))
'(a 1 2 3 (5 . 6) + bbbb)
> (null? '())
#t
> (null? '(1 2 3))
#f
> (length '(1 2 3))
3
> (take 3 '(1 2 3 4 5 6 7 8))	// am dat argumentele invers
. . take: contract violation
  expected: exact-nonnegative-integer?
  given: '(1 2 3 4 5 6 7 8)
  argument position: 2nd
  other arguments...:
> (take '(1 2 3 4 5 6 7 8) 3)
'(1 2 3)
> (drop '(1 2 3 4 5 6 7 8) 3)
'(4 5 6 7 8)
> (map add1 '(1 2 3 4 5))
'(2 3 4 5 6)
> (map odd? '(1 2 3 4 5))
'(#t #f #t #f #t)
> (filter odd? '(1 2 3 4 5))
'(1 3 5)
> (filter zero? '(0 1 2 0 3 4 0 5))
'(0 0 0)
>