Gaud!

Gaud es ling de programation concatenativ ub information es codificat ut sac de symbols et omn operation es composition de fractions per multiplication, de quem denominator consum symbols et numerator inser symbols.

Fundamental

• Stat de program: Sac de symbols sin ordin. [cub con^3] et [con^3 cub] contin un cub et tres con.
• Symbols: Element de sac es scrib ut numer decimal aut nomin pro numer prim.[8 sphaer^2] val [2^3 sphaer sphaer].
• Transformation: Fraction denominator indic consumption et numerator insertion. strix/[fels^2] consum du fel, inser un strix.

Evaluation es aplication de fractions in sequent, si denominator ades in sac: consum denominator et inser numerator, aut tent juxt fraction, etc..

[fel can ran^2]      ( Sac hab 1 fel, 1 can et 2 rans )
[fel can^3]/ran      ( Si sac hab 1 ran, camb pro 1 fel et 3 cans )
    []/[ran fel^2]   ( Si sac hab 1 ran et 2 fels, tol ils )
    urs/can^fel      ( Si sac hab tam mult can quam fel..
                        .. me camb can in numer de fel pro 1 urs )
[can^4 urs]          ( Me reman cum 4 cans et 1 urs )

Si nul fraction aplicabil, program sist.

Logic

Hic es implementation de logic-port NON.

fals non
	ver/[fals non]
	fals/[ver non]

[fals non] ver/[fals non] fals/[ver non] 
[ver] fals/[ver non] 
[ver]

Notar necesitat de symbol vigil aut in implementation de logic-port AUT ob deteg fals:

x y aut
	ver/[x y aut]
	ver/[x aut]
	ver/[y aut]
	fals/aut

[x y aut] ver/[x y aut] ver/[x aut] ver/[y aut] fals/aut 
[ver] ver/[x aut] ver/[y aut] fals/aut 
[ver] ver/[y aut] fals/aut 
[ver] fals/aut 
[ver]

Met

Met symbolos @nomin es special cum position de salt in program. Quand met ades in sac, evaluation salt ad position. Hic es exempl de circuit simplic:

tempor^5

@Circuit ( tempor -- )
	Circuit/tempor
fin

[tempor^5] Circuit/tempor fin
[tempor^4] Circuit/tempor fin
[tempor^3] Circuit/tempor fin
[tempor^2] Circuit/tempor fin
[tempor] Circuit/tempor fin
[] Circuit/tempor fin
[] fin
[fin]

Per hoc mechanism de circuit, scriber regul que exhaur symbol. Per exempl, hic implementation de comparation major, si x>y ver aur fals:

x^3 y^2

@Major ( x y -- x y ver|fals )
	Major/[x y]
	ver/x Major/x
	fals/y Major/y

[x^3 y^2] Major/[x y] ver/x Major/x fals/y Major/y 
[x^2 y] Major/[x y] ver/x Major/x fals/y Major/y 
[x] Major/[x y] ver/x Major/x fals/y Major/y 
[x] ver/x Major/x fals/y Major/y 
[ver] Major/x fals/y Major/y 
[ver] fals/y Major/y 
[ver] Major/y 
[ver] 

Anonym Met

Us de anonym met es mod veloc pro scrib fraction que exhaur. Per exempl, fraction pro adition @Ad [x Ad]/y es etiam scriber ut 'x/y, que indic interpret de crear un met ad loc.

x^3 y^4 'x/y

[x^3 y^4] 'x/y 
[x^4 y^3] 'x/y 
[x^5 y^2] 'x/y 
[x^6 y] 'x/y 
[x^7] 'x/y 
[x^7] 

Arithmetic

Pro inven diferent inter 2 numer, program consum 1 de singul usq ad exhaustion, que relinq x pro event positiv, aut y pro event negativ. Ultim du met exhaur numer aut pos aut neg:

x^2 y^5

@Sub ( x y -- pos|neg )
	Sub/[x y] 'pos/x 'neg/y

[x^2 y^5] Sub/[x y] 'pos/x 'neg/y 
[x y^4] Sub/[x y] 'pos/x 'neg/y 
[y^3] Sub/[x y] 'pos/x 'neg/y 
[y^3] 'pos/x 'neg/y 
[y^3] 'neg/y 
[y^2 neg] 'neg/y 
[y neg^2] 'neg/y 
[neg^3] 'neg/y 
[neg^3] 

Hic es un program plus complex que inven product ex du numer per us de met:

x^2 y^3

@Mul ( x y -- res )
	[Mul z res]/y 'y/z Mul/x '1/[y res]

Intr/Extr

Symbol iniciat per . emit ut text et consum subit ex sac. Symbol iniciat per .# emit numer de instant in sac de symbol specific.

porc^3
	( vocabul ) .Computat:
	( numer   ) .#porc

Computat:3

HocusPocus

In fin, neces implementation de HocusPocus:

tempor^100 f b

@Circuit ( tempor -- )
	[num f b .HocusPocus\n Circuit]/[tempor f^3 b^5]
	[num f b .Hocus\n Circuit]/[tempor f^3]
	[num f b .Pocus\n Circuit]/[tempor b^5]
	[num f b .#num .\n Circuit]/tempor

1, 2, Hocus, 4, Pocus, Hocus, 7, 8, Hocus, Pocus, 11, Hocus, 13, 14, HocusPocus, 16, 17, ..

• Codice, Uxntal.
• Repositorio, Uxntal.
• Latin Sin Flexion
• Giusepe Peano, Wikipedia.

incoming: rejoice latin sin flexion 2026