Email or username:

Password:

Forgot your password?
All posts WimⓂ️'s posts Back to profile
12 posts total
WimⓂ️

Oh rascal children of Gaza.
You who constantly disturbed me
with your screams under my window.
You who filled every morning
with rush and chaos.
You who broke my vase
and stole the lonely flower on my balcony.
Come back,
and scream as you want
and break all the vases.
Steal all the flowers.
Come back...
Just come back...

Khaled Juma

(via postersforpalestine.org/)

Oh rascal children of Gaza.
You who constantly disturbed me
with your screams under my window.
You who filled every morning
with rush and chaos.
You who broke my vase
and stole the lonely flower on my balcony.
Come back,
and scream as you want
and break all the vases.
Steal all the flowers.
Come back...
Just come back...

21 April at 16:30 | Open on merveilles.town
WimⓂ️

So a green-painted SUV is now solarpunk

20 March at 9:03 | Open on merveilles.town
WimⓂ️

I made some estimates on what OpenAI's chip needs mean for global CO2 emissions. I call it "
The insatiable hunger of (Open)AI"

wimvanderbauwhede.codeberg.pag

13 March at 18:07 | Open on merveilles.town
WimⓂ️
WimⓂ️

If anyone would be interested in giving an online talk related to #FrugalComputing or #LowCarbonComputing or #SustainableComputing for my research group, some time in October, November or December, please let me know. You don't have to be an academic researcher.

For info, my research group page: gla.ac.uk/schools/computing/re

23 Aug 2023 at 14:35 | Open on merveilles.town
WimⓂ️

I wrote a blog post on how Funktal handles Uxn/Varvara I/O devices and state, with examples of a few GUI-based programs.

wimvanderbauwhede.codeberg.pag
#Funktal
#Uxn

3 Aug 2023 at 16:59 | Open on merveilles.town
WimⓂ️

I will give an online talk for the fedi Solstice School on 2023-07-26 (Wed) 13:00 UTC

"Funktal: a frugal functional programming language"

Funktal is a "modern" functional programming language for the Uxn virtual machine, a tiny VM with 64 kB of memory. I will explain why I created it, some of the cool functional features it has, how it is implemented and why, and where it could be going.

Sign up at

solsticeschool.scholar.social/

or just ask me for the link

#FrugalComputing #SolsticeSchool2023

I will give an online talk for the fedi Solstice School on 2023-07-26 (Wed) 13:00 UTC

"Funktal: a frugal functional programming language"

Funktal is a "modern" functional programming language for the Uxn virtual machine, a tiny VM with 64 kB of memory. I will explain why I created it, some of the cool functional features it has, how it is implemented and why, and where it could be going.

25 Jul 2023 at 19:29 | Open on merveilles.town
WimⓂ️

I'm doing the slides for my Solstice School talk on Funktal in Adelie. It's fun to create dithered lores versions of images.

#SolsticeSchool2023 #Uxn

10 Jul 2023 at 19:21 | Open on merveilles.town
Alexander Cobleigh

@wim_v12e lmao i interpreted "lores" not as low resolution, but as "lore" versions. honestly could see dithered lore versions of images

10 Jul 2023 at 19:23 | Open on merveilles.town
Devine Lu Linvega

@wim_v12e Have a look at the strangeloop repo on ~rabbits sr.ht if you're looking for ideas on how to handle fades and so on. There's an undocumented RGB4 command that lets you transition between colors, it's pretty useful.

10 Jul 2023 at 19:44 | Open on merveilles.town
WimⓂ️

My little functional language for Uxn, Funktal, is finally in a state good enough for a blog post:

"Funktal: a frugal functional programming language"

wimvanderbauwhede.codeberg.pag

You can also try it out:

codeberg.org/wimvanderbauwhede

#Funktal #Uxn

11 Apr 2023 at 12:00 | Open on merveilles.town
Show previous comments
sejo ✨🌊

@wim_v12e The write-up is slightly over my head for now, but I think it's fantastic you managed to achieve it! 👏

11 Apr 2023 at 14:24 | Open on merveilles.town
⛧ esoterik ⛧

@wim_v12e this is great work. 🏆 thanks for sharing!

11 Apr 2023 at 14:43 | Open on merveilles.town
Devine Lu Linvega

@wim_v12e I'm going through the project atm, but before I forget, I meant to send you this paper trying to do a similar RPN lambda implementation: complang.tuwien.ac.at/anton/eu

11 Apr 2023 at 16:31 | Open on merveilles.town
WimⓂ️

I got recursion working in #Funktal, and now I can write this fixedpoint factorial:

-- the fixedpoint function
functions {
fix = (\f. f f apply )
}

main {
5
`(\ n <- f .
`(1)
`( n n 1 - f f apply * )
n 1 ==
if
) fix print
}

This actually works, even if it is still a bit rough around the edges.

31 Mar 2023 at 19:07 | Open on merveilles.town
Devine Lu Linvega

@wim_v12e Oh, that is cool. Could you make me a rom of this one? I'd love to run it through beetbug

31 Mar 2023 at 19:09 | Open on merveilles.town
WimⓂ️

Finally, my #Funktal compiler can emit correct #Uxntal for some simple examples.

The first one shows named functions, lambda functions and primitive types:

functions {
sq = (\Int <- x:Int. x x *)
}

main {
6 7 (\ Int <- x:Int <- y:Int . x y * sq )
print
}

Funktal uses postfix notation for expressions and types. In Haskell, the sq function would be

sq :: Int -> Int
sq = \x -> x*x

Finally, my #Funktal compiler can emit correct #Uxntal for some simple examples.

The first one shows named functions, lambda functions and primitive types:

functions {
sq = (\Int <- x:Int. x x *)
}

main {
6 7 (\ Int <- x:Int <- y:Int . x y * sq )
print
}

Funktal uses postfix notation for expressions and types. In Haskell, the sq function would be

23 Mar 2023 at 9:37 | Open on merveilles.town
WimⓂ️

The second example shows the use of an algebraic data type, a tuple:

types {
Tup = Int Int MkTup
}

main {
6 7 MkTup (\ Int <- (x y MkTup): Tup . x y * )
print
}

MkTup creates a tuple of two integers. In Haskell this would be

data Tup = MkTup Int Int

The lambda function pattern matches on the type, so x and y bind to the stored values.

#Funktal

The second example shows the use of an algebraic data type, a tuple:

types {
Tup = Int Int MkTup
}

main {
6 7 MkTup (\ Int <- (x y MkTup): Tup . x y * )
print
}

MkTup creates a tuple of two integers. In Haskell this would be

data Tup = MkTup Int Int

The lambda function pattern matches on the type, so x and y bind to the stored values.

23 Mar 2023 at 9:39 | Open on merveilles.town
WimⓂ️

I wrote a blog post about my Uxntal to C compiler.

"Compiling stack-based assembly to C"

Apart from the explanations it has some performance and power results.

tl;dr: for compute-intensive code, the compiled version gives up to 12x speed-up.
For interactive GUI code, there is no speed-up and no difference in power consumption, confirming the point I made in another post: Uxn efficiency is a red herring.

wimvanderbauwhede.github.io/ar

#Uxntal #Uxn #compiler

I wrote a blog post about my Uxntal to C compiler.

"Compiling stack-based assembly to C"

Apart from the explanations it has some performance and power results.

tl;dr: for compute-intensive code, the compiled version gives up to 12x speed-up.
For interactive GUI code, there is no speed-up and no difference in power consumption, confirming the point I made in another post: Uxn efficiency is a red herring.

16 Oct 2022 at 16:53 | Open on merveilles.town
Devine Lu Linvega

@wim_v12e

"jumps to computed addresses, because that is a concept that is not supported in C"

TIL.

16 Oct 2022 at 16:59 | Open on merveilles.town
Go Up