BBC6Music 🎶 #NowPlaying BotMay 30, 2025

🇺🇦 #NowPlaying on #BBC6Music's #6MusicsRaveForever

System F:
🎵 Out of the Blue

#SystemF

https://edicionesyremixesdjalesvanhotmailcom.bandcamp.com/track/system-f-out-of-the-blue-ext-edit

https://open.spotify.com/track/7fIfO8fZ55Eq5qtd5vCd6z

System F - Out Of The Blue (Ext. Edit), by [email protected]

track by [email protected]

[email protected]
Joachim WibergApr 13, 2025

Ever since the start of winter, I've been going back to the start of #ASOT, in search for the all-time trance classics. OMG, there are SO MANY! 🥰

One of my ultimate #Trance favorites though is Exhale by #SystemF (#FerryCorsten) and #ArminvanBuuren from the year 2000. (It's insane it's a quarter of a century old already! 🤯)

https://open.spotify.com/track/27UtFUJ4KqzGDKdrNnmj5K?si=82809c4f7145402d

Exhale [ASOT 003] - Ferry Corsten & Armin van Buuren New Mix

System F, Armin van Buuren, Ferry Corsten · A State Of Trance Episode 003 · Song · 2001

Spotify
Show thread𝚛𝚊𝚝Feb 5, 2025
@screwtape https://en.wikipedia.org/wiki/Lambda_cube #lambdacalculus #coq #systemf
Lambda cube - Wikipedia

HoldMyTypeDec 5, 2024
a simple extension to the prenex fragment of #SystemF that allows closures to be stack-allocated.
https://arxiv.org/abs/2108.07389
Solving the Funarg Problem with Static Types

The difficulty associated with storing closures in a stack-based environment is known as the funarg problem. The funarg problem was first identified with the development of Lisp in the 1970s and hasn't received much attention since then. The modern solution taken by most languages is to allocate closures on the heap, or to apply static analysis to determine when closures can be stack allocated. This is not a problem for most computing systems as there is an abundance of memory. However, embedded systems often have limited memory resources where heap allocation may cause memory fragmentation. We present a simple extension to the prenex fragment of System F that allows closures to be stack-allocated. We demonstrate a concrete implementation of this system in the Juniper functional reactive programming language, which is designed to run on extremely resource limited Arduino devices. We also discuss other solutions present in other programming languages that solve the funarg problem but haven't been formally discussed in the literature.

arXiv.org
HoldMyTypeAug 18, 2023
polymorphic calculi like #systemF, it would be nice to be able to infer the type abstractions and applications, and omit the annotations on λs as above. This is also undecidable, but the proof is much harder
https://cs.stackexchange.com/questions/12691/what-makes-type-inference-for-dependent-types-undecidable/12957#12957
What makes type inference for dependent types undecidable?

I have seen it mentioned that dependent type systems are not inferable, but are checkable. I was wondering if there is a simple explanation of why that is so, and whether or not there is there a li...

Computer Science Stack Exchange
Show threadxameerAug 4, 2021
write syntax tree in a type that is not well typed with #systemf
Hyperreal Gopher Apr 9, 2021

I just finished the State section of #systemf's #fpcourse! I wanted to double down on learning #haskell before I got back to working on projects.

https://gist.github.com/hyperrealgopher/2990e00193f65a56009fac37cec0372c

A link to my older solutions: https://fosstodon.org/@hyperrealgopher/105960643461269805

system-f/fp-course: State.hs

system-f/fp-course: State.hs. GitHub Gist: instantly share code, notes, and snippets.

Hyperreal Gopher Apr 8, 2021

I need to keep my comments that I write to think out problems instead of deleting them to make my code seem clearer as I progress through #systemf's #fpcourse.

Others might find that useful.

#haskell

xameerMar 6, 2021
- Whereas simply typed lambda calculus has variables ranging over terms, and binders for them, #SystemF additionally has variables ranging over types, and binders for them.