Cation Lang

🤔 I thought they were part of the default syntax in swift

np the website is cool maybe add a search function if possible

https://cation-lang.org/reference/#annotations-1 can users declare their own annotations? or are they a predefined set

fixed

If you had a backend it could be done with html also

over next weeks I will work on trying different cases in Cation; it could be that it would actually need some form of lambda syntax with \( ... ) - similar to Haskel way, such that the above becomes someMethod arg1, arg2, \( statement1 statement2 statement3 )

Here is a concept for the lambda expressions: https://cation-lang.org/design/#lambda-expressions

I have drafted page explaining how Cation relates to Category theory constructions: https://cation-lang.org/category/

not yet; the language is in the design phase; I will start working on the compiler only after the main part of the language design would finalize

I took a simple map function for an optional/maybe type which maps its value to another type via a provided closure, and asked ChatGPT to show how it looks like in Haskell, Scala, Idris, Rust, Swift, Python and C++. Than I gave it the same function written in Cation and asked to analyse it. The results are here: https://chatgpt.com/share/6724d4d8-b9c0-8013-8645-463ae6864836 At least, according to ChatGPT, the Cation has the highest conciseness of all these languages :) (see table at the end of chat)

Here how the function looks in Cation fx map: T, U, F: T -> U => Maybe T, F -> Maybe U none, _ => none some(val), f => some(f val)

yes, I fixed the typo and ChatGPT generated a second branch (you should see small switch to go betweeen branches underneath)

@dr_orlovsky @dr_ukolova spam

The problems of provable (formally-verifiable) program safety and determinism became crucial in the age of modern LLMs. I am developing AluVM and Cation as a constructionist and ultrafinitist tool: in each type is a finite set of constructable objects; so there is type N8 made of all natural numbers (0 is not natural!) in range 1-256 included, N16, N32 and N64. There are integers of the same sort (0 included), I8, I16, I32 etc. There are no floating-point numbers, only rationals (in the Norman Wildberger style), no sine/cosine - only rational trigonometry. Integers are pairs of numbers, not just “unsigned with a sign bit”, rationals are pairs of integers (i.e. quadruples of numbers). It uses dependent types (calculus of constructs), but restricts to finite types only. All functions are total, the termination analysis proves that. There is no recursion which can’t be reduced to a provable-terminating computation at compile-time. This gives a language and computational system which is formally analyzable at compile-time, by its structure. Additionally to that, a binary compiled code is also formally analyzable and has a verifiable properties.