Skinney

18 ms·

181.
by Skinney 5y ago
Right. Not sure. Ad-hoc polymorphism is currently in the design-phase and I'm looking at many possible solutions. But before I get to that point I still have a lot of stuff to implement first.
182.
by Skinney 5y ago
I've only looked at Kitten, but since that language aims to be the spiritual successor to Cat, I believe these comments still applies. Kitten allows infix operators, from what I've seen, which IMHO reduces one of the benefits of t
183.
by Skinney 5y ago
I originally wanted to create "Elm with unions instead of ADTs, that compiles to wasm", but I had recently discovered Factor and Forth and found I enjoyed the syntax and semantics better than ML. I'm a minimalist, I'm no
184.
by Skinney 5y ago
Stabel is staticly typed with strict control of side effects (they're present in the type system). Since Stabel compiles to wasm, it can and will eventually be run in the browser (the playground at the Stabel website works by compiling
185.
by Skinney 5y ago
I think so. I don't have much experience with Joy, but `if` is defined as a regular function in Stabel's stdlib.
186.
by Skinney 5y ago
I had not seen that paper. Thank you for sharing with me =)
187.
by Skinney 5y ago
The goal is that Stabel should work well in browsers, and part of that is producing small .wasm files. So yes, I think it should be a good fit. Stabel is also aimed at backends and CLI tools.
188.
by Skinney 5y ago
Stabel doesn’t have floats, yet, but when it does: yes, if you put it in a different module.
189.
by Skinney 5y ago
If you click the "Detail" tab at the top of the page, you get the date it was posted.
190.
by Skinney 5y ago
Yes. Stabel is staticly typed, and types are inferred if the type signature is left out. You could also write the code as: def: cube type: Int -- Int : dup dup * *
191.
by Skinney 5y ago
def: cube : dup dup * * def: main : 3 cube
192.
by Skinney 5y ago
Thank you! I’ll fix it :)
193.
by Skinney 5y ago
I'm the author of Stabel. AMA.
194.
Stabel: A pure, concatenative and statically typed programming language(fossils.stabel-lang.org)
90 points by Skinney 5y ago|58 comments
195.
by Skinney 5y ago
Call/text them on a _monthly_ basis?
196.
Stabel: A pure, concatinative programming language that targets WASM(stabel-lang.org)
4 points by Skinney 5y ago|0 comments
197.
by Skinney 5y ago
Considering most train routes operate at a net loss, «we used to pay x but now we pay y» is really the only interesting metric, no? Profits from subsidies aren’t really profit when you’re the one paying the subsidy. Keep in mind, that befor
198.
by Skinney 5y ago
If all you care about is the cheapest possible ride, you’ll get that through the government ticketing service. If you travel the same distance often and want to pay extra for more comfort or whatever, you’ll benefit from using whatever tick
199.
by Skinney 5y ago
They don’t have to lease their trains from the government, they can bring their own trains if they’d like, but leasing is likely cheaper. The company maintaining the trains do have to bid on the contracts, as well, and can bid for contracts
200.
by Skinney 5y ago
Rust was inspired by Elm, if I’m not much mistaken.
201.
by Skinney 5y ago
While I agree with his points in principle, Rust isn't actually a great example to use. Rust allows to simply spawn threads, right? So a function not being marked 'async' doesn't necessarily give any guarantees about pot
202.
by Skinney 6y ago
One can be used for display _and_ charging, right?
203.
Play (the programming language) is now Stabel(fossils.play-lang.dev)
1 points by Skinney 6y ago|0 comments
204.
by Skinney 6y ago
My stack-oriented, concatinative programming language. Currently working on a name change as well as the Alpha 2 (modules/namespaces). Take a look: https://www.play-lang.dev/
205.
by Skinney 6y ago
True. Go, for instance, does not use a generational garbage collector. I also believe that Java’s Zgc is not generational, yet. But I find it most helpful to instead focus on the current context, otherwise I’d be spending all typing.
206.
by Skinney 6y ago
Yeah, which is why I mentioned the thing about destructors. The first GC will schedule an object to be disposed/destroyed, but still keep it around for abit. It’s true that in that case it makes sense to «delete» an object. But in that
207.
by Skinney 6y ago
The GC kicks in when allocating a new object and it decides it needs more memory. GC likely kicked in as you allocated the last object, and after the collection phase, still didn’t have enough memory and so failed. I believe objects with de
208.
by Skinney 6y ago
I live in downtown Oslo (capitol of Norway). I park my car on the street, but we have a decent amount of type-2 chargers around so its hardly any trouble. We’ve charged on a fast-charger three times the past three months, all of those times
209.
by Skinney 6y ago
I guess I could provide a bit more info. A generational GC as the one in .NET allocates memory up-front, then passes out references/pointers from that allready allocated memory. When the GC is getting close to the end of the pre-alloca
210.
by Skinney 6y ago
With a GC like the one used in .NET, «deleting» an object is a noop. It wouldn’t give you any benefits over not deleting it. You only pay a price for living things (as in, some object holding a reference to it), the rest is free.

More ›