/prog/ - Initial Version of Symta Tutorial

Name: Anonymous 2014-10-28 21:01

https://github.com/saniv/symta/blob/master/doc/symta-by-example.md

Criticism isn't welcome: it will hurt my feeling and I'll be crying like a girl.

Name: Anonymous 2014-10-28 21:04

i fucking love you so much megakike, holy fucking shit
i love you nikiketa, i truly do

Name: Anonymous 2014-10-28 21:34

This should [bootstrap] the compiler, producing ./symta executable.
On Windows it is [advised] to install GCC through mingw64.
You must convert [your] integers to floats
[registers] new type point with
If [the|a] method takes arguments, they can be specified using [].
To do [that,] Symta provides inheritance.
This [technique] is called 'sinking'.
Lists pose a problem of transforming them and [accessing] their elements
the first example can be packed into a [separate] module.s file
directory and the [directory] of the file
would [produce] 6.28318530 at compile time

ALSO: succinct is overused. Try using a thesaurus.

Name: Rabbi Chaim Goldstein 2014-10-28 22:33

Pretty good! See you at the Synagogue next Sabbath!

Name: Anonymous 2014-10-28 23:09

>>3

Thank you, the attentive progrider! How do you manage to notice all the details, while quickly looking through text?

Name: Anonymous 2014-10-28 23:47

>>3
What's your point? All of those are spelled correctly.

Name: Anonymous 2014-10-28 23:55

>>6

That is because I've already fixed them thanks to >>3

Name: Anonymous 2014-10-29 0:33

still unreadable

Name: Anonymous 2014-10-29 4:05

Is neo symta a superset of old symta? I want to be able to write in cryptic old symta.

Name: Anonymous 2014-10-29 4:25

>>9

Is neo symta a superset of old symta?

No. It is different. Old Symta used immutable data structures, had somewhat weakly-type core-functions and was very inefficient. The new one is designed to be the fastest dynamically typed language and integrate nicely with C/C++.

I want to be able to write in cryptic old symta.

use macros

Name: Anonymous 2014-10-29 8:51

I liked the old Symta better because it was so dense and cryptic and inconsistent. It looked more like someone trying to recall and type in an APL program after seeing it for 30 seconds a day before, while being shit-faced and getting a blowjob from a tranny. New Symta looks too practical, too much like Ruby.

Name: Anonymous 2014-10-29 11:44

Symta looking like Ruby may or may not have something to do with the fact that unsweetened coffee in Russian Starbucks--and there are dozens of them in Moscow alone, maybe close to a hundred--tastes like boiled garbage that started to ferment. Saccharine syrup manages to hide it to a certain point.

Name: Anonymous 2014-10-29 17:43

>>11,12
But Symta has nothing to do with Ruby and based on different design ideas.

Name: Anonymous 2014-10-29 19:54

>>13
Read Apples and Oranges: A Comparative Study.

Name: Anonymous 2014-10-30 1:12

It looks pretty wild =)

Name: Anonymous 2014-10-30 1:56

sorry, not enterprise enough. please add

public protected private internal external static void class struct namespace object oriented inheritance xml .NET CLR JAVA Beans LINQ xslt ADO COM properties delegates frameworks metadata windows forms WPF and Javascript.

Name: Anonymous 2014-10-30 1:58

sorry, not enterprise enough. please add

 
public protected private internal external static void class 
struct namespace object oriented inheritance xml .NET CLR JAVA
 Beans LINQ xslt ADO COM properties delegates frameworks 
metadata windows forms WPF and Javascript.

Name: Anonymous 2014-10-30 1:59

>>17
and bussiness object, don't forget those.

Name: Anonymous 2014-10-30 2:04

I think i could pick it up, though i never really learnt lisp before..

qsort@r$[] [H@T] = [@T.keep{?<H}^r H @T.skip{?<H}^r]

qsort /function name
@r$ /recursive alias r ?
[] /empty list?
[H@T] /list arg H first list element // T last list element?

=

[@T.keep{?<H}^r H @T.skip{?<H}^r]

== [qsort{@T.keep{?<H}} H qsort{@T.skip{?<H}}] ?

~== list(quicksort(list < H ), H, quicksort(list > H))

Name: Anonymous 2014-10-30 2:10

>>19

Read the Pattern Matching section. It explains that example.

qsort /function name

@r$ /recursive alias r ?

Yes. But $ sepcifies default value

[] /empty list?

yes

[H@T] /list arg H first list element // T last list element?

No. T is tail: [X@Xs] is Haskell's (x:xs)

[@T.keep{?<H}^r H @T.skip{?<H}^r]

The @ is ,@ from Common Lisp. Because originally language looked just like CL.

Name: Anonymous 2014-10-30 3:48

this is my old-school sort ^^

function hand = cardSort(cardList)

hand = cardList(1);

n = length(cardList);

for(iter = 2:n)

  card = cardList(iter);

  hand = [hand(hand <= card), card, hand(hand>card)];

  endfor;

endfunction;

Name: Anonymous 2014-10-30 11:27

like this?

cardSort Cardlist = for Card Cardlist: Hand <= [Hand.keep{?>Card} Card Hand.skip{?>Card}]

Name: Anonymous 2014-10-30 17:23

>>22
You forgot the `@`
[@Hand.keep{?>Card} Card @Hand.skip{?>Card}]

Anyway, real-world quicksort is implemented like this:
1. produce a shuffled copy of input list
2. sort it, without allocating additional memory with keep/skip

Initial Version of Symta Tutorial

1 Name: Anonymous 2014-10-28 21:01

2 Name: Anonymous 2014-10-28 21:04

3 Name: Anonymous 2014-10-28 21:34

4 Name: Rabbi Chaim Goldstein 2014-10-28 22:33

5 Name: Anonymous 2014-10-28 23:09

6 Name: Anonymous 2014-10-28 23:47

7 Name: Anonymous 2014-10-28 23:55

8 Name: Anonymous 2014-10-29 0:33

9 Name: Anonymous 2014-10-29 4:05

10 Name: Anonymous 2014-10-29 4:25

11 Name: Anonymous 2014-10-29 8:51

12 Name: Anonymous 2014-10-29 11:44

13 Name: Anonymous 2014-10-29 17:43

14 Name: Anonymous 2014-10-29 19:54

15 Name: Anonymous 2014-10-30 1:12

16 Name: Anonymous 2014-10-30 1:56

17 Name: Anonymous 2014-10-30 1:58

18 Name: Anonymous 2014-10-30 1:59

19 Name: Anonymous 2014-10-30 2:04

20 Name: Anonymous 2014-10-30 2:10

21 Name: Anonymous 2014-10-30 3:48

22 Name: Anonymous 2014-10-30 11:27

23 Name: Anonymous 2014-10-30 17:23