I really enjoyed @Felienne's narrative about narratives about Computer Science yesterday. She applied some of the ideas presented in the Glaciers, Gender and Science paper (https://journals.sagepub.com/doi/abs/10.1177/0309132515623368) to her experiences in the Computer Science / Programming Languages communities. She's also starting a reading club to brainstorm the meaning (and the name?) of the field of "Computer Science".

#ICTOpen
#ICTOpen2025
#NWO
#Conference
#AcademicMastodon
#AcademicChatter
#ICT
#Research
#Networking
#Utrecht
#Jaarbeurs
#ComputerScience
#ProgrammingLanguages
#WomenInComputing
#WomenInSTEM
#Glaciology

SAGE Journals: Your gateway to world-class research journals

Subscription and open access journals from SAGE Publishing, the world's leading independent academic publisher.

Universal Scripting Language - Turn any programming script into 1 or 100+

Program in the language(s) you want instantly!USL: One Script, 100+ Languages — Build It Once. Use It Everywhere.

Gumroad
GitHub - realdanvanth/telos: a DSL /Esolang interpreted by java

a DSL /Esolang interpreted by java. Contribute to realdanvanth/telos development by creating an account on GitHub.

GitHub
"Super Haskell": an introduction to Agda by André Muricy - Ada Beat

André presents "Super Haskell": an introduction to Agda, a dependently typed programming language, and its philosophy, and underlying theory.

Ada Beat
Global rename and find references

Gleam v1.10.0 released

https://www.cs.utexas.edu/~EWD/transcriptions/EWD06xx/EWD667.html
Dijkstra's thoughts on natural language programming and its folly.

I have mixed feelings about what he says here. On the one hand, I strongly agree with his observations qua *the clarity required for repeatable tasks*, and he is also right about the power of formal symbolism, but something about his definition of "non-sense" rubs me the wrong way: his rather shaky Eurocentric historical narrative. There is no reason to treat the the invention of symbolic Algebra as "feeble" given that natural language argumentation followed in the wake of it. Do modern mathematicians not do as much handwaving on certain cutting edge subjects before formalizing? The power of vagueness in the hands of a human being with real semantic thoughts can capture unknowns as superposition and is at least part of where creativity derives from. However, it does not make repeatable procedures, and *that* is why it is not appropriate for computing.

#llms #nollm #Programming #ProgrammingLanguages

E.W.Dijkstra Archive: On the foolishness of "natural language programming". (EWD 667)

At some point, type safety is indistinguishable from template metaprogramming.

#programming #programmingLanguages

Zyme - an evolvable language

With the NWO XL consortium on Cyclic Structures in Programs and Proofs, we are looking for 6 highly motivated and talented PhD students starting in September (with some flexibility).

The topics range from Modal logic, proof theory, and coalgebras to Programming languages, concurrency, and type systems and Proof assistants (#Agda, #Rocq).

Information about the positions and application procedure can be found on the website:

cyclic-structures.gitlab.io/vacancies/

Applications will be evaluated on a rolling basis but should be submitted by the 23rd of May for full consideration.

Please forward to any strong candidates you know!

#TypeTheory #ModalLogic #Concurrency #ProgrammingLanguages #TypeSystems #ProofAssistants #CyclicStructures #PhD #Netherlands #UniversityOfGroningen #LeidenUniversity #UniversityOfTwente #TUDelft #RadboudUniversity
Vacancies

This site collects information about positions, publications and relevant news for the project “Cyclic Structures in Programs and Proofs” project, funded by NWO. The project aims to advance the theory of cyclic structures in proofs and programs, including in coalgebraic modal logic, type theory, behavioural types, and the proof assistants Agda and Rocq (formely Coq), and create a development environment for Rust based on these techniques.

Cyclic Structures in Programs and Proofs

Bit of a newbie question, but why is CPS favored for IRs for functional languages? Links welcome 😁

#plt #programminglanguages #functionalprogramming #compilers