# language Published articles for language. This is one page of public article previews, not the complete archive. Follow Next page to continue. Summaries are not the original full articles. ## What's New in PHP 8.6 DevFeed: [What's New in PHP 8.6]() Original publisher: [Read original article]() Author: Freek Van der Herten (freek@spatie.be) Published: 2026-09-16T12:30:30Z Content type: release Language: en Sources: [freek.dev - all blogposts]() Topics: [PHP 8.6](), [PHP](), [function]() Tags: [improvements](), [language](), [php](), [php-8-6](), [standard-library]() ### AI overview An overview of upcoming PHP 8.6 changes, including partial function application, clamp(), the Duration class, and other language and standard library improvements. ### Source excerpt A concise overview of what's coming in PHP 8.6, including partial function application, clamp(), the new Duration class, and several smaller language and standard library improvements. Read more ## i18nize-templates: Internationalization After the Fact DevFeed: [i18nize-templates: Internationalization After the Fact]() Original publisher: [Read original article]() Author: Khan Academy Published: 2015-09-28T22:00:00Z Content type: release Language: en Sources: [Khan Academy]() Topics: [Internationalization (i18n)](), [Localization (l10n)](), [Open Source](), [Python](), [Handlebars](), [HTML](), [Library](), [Code](), [JavaScript](), [Babel]() Tags: [babel](), [code](), [engineering](), [html](), [infrastructure](), [javascript](), [language](), [languages](), [library](), [news](), [open-source](), [programming](), [python]() ### AI overview Khan Academy describes retrofitting its English-only codebase for internationalization and localization across several HTML-rendering technologies. It introduces i18nize-templates, an open-source Python module that finds natural-language text in HTML and templates and marks it as i18n-aware. The tool supports raw HTML, jinja2, and Handlebars templates and reportedly reduces template annotation time by over 90%. ### Source excerpt By Craig Silverstein Khan Academy started as a collection of videos, but now has over 100,000 pieces of ... Read more ## How an MIT research project became a global programming language DevFeed: [How an MIT research project became a global programming language]() Original publisher: [Read original article]() Author: Zach Winn | MIT News Published: 2026-08-31T04:00:00Z Content type: news Language: en Sources: [MIT AI News]() Topics: [The Julia Language](), [Programming language](), [Data Science](), [Complex Systems](), [Data analysis](), [Open Source]() Tags: [ai](), [ai-platform](), [alan-edelman](), [analysis](), [applications](), [artificial-intelligence](), [chris-rackauckas](), [complex-systems](), [computer-science-and-artificial-intelligence-laboratory-csail](), [deshpande-center](), [jeff-bezanson](), [julia-programming-language](), [juliahub](), [language](), [mit-schwarzman-college-of-computing](), [open-source](), [programming](), [programming-language](), [software](), [startups](), [stefan-karpinski](), [viral-shah]() ### AI overview An MIT research project created Julia, a free and open-source programming language for scientific research, data analysis, and complex-systems modeling. The article describes Julia's adoption by researchers, engineers, companies, and universities, and introduces JuliaHub's Dyad 3.0 AI platform. ### Source excerpt With millions of users across the world, Julia has been used to conduct cutting-edge research and to design new drugs, jet engines, heat pumps, and more. ## Leonardo de Moura on Lean, Formal Verification, and the Future of Mathematics DevFeed: [Leonardo de Moura on Lean, Formal Verification, and the Future of Mathematics]() Original publisher: [Read original article]() Author: Ryan Peterman Published: 2026-08-10T13:03:04Z Content type: article Language: en Sources: [The Developing Dev]() Topics: [Lean](), [Formal verification](), [math](), [Large Language Model]() Tags: [code](), [formal-verification](), [google](), [language](), [llms](), [math](), [podcasts](), [programming](), [programming-language](), [software](), [verification]() ### AI overview An interview with Leonardo de Moura, creator of Lean, about using the programming language for machine-checkable proofs, software verification, and mathematical reasoning. The discussion also covers how LLMs can work with Lean to generate and verify proofs. ### Source excerpt In 2024, AlphaProof from Google Deepmind broke through in competition math achieving a silver-medal in Interational Mathematical Olympiad (IMO). ## Dependent Types and the Challenge of Automating Proofs DevFeed: [Dependent Types and the Challenge of Automating Proofs]() Original publisher: [Read original article]() Author: Adam Langley Published: 2026-07-26T00:00:00Z Content type: opinion Language: en Sources: [ImperialViolet]() Topics: [Programming language](), [Lean](), [Programming](), [Coq]() Tags: [interactive](), [language](), [machine](), [programming](), [programming-language]() ### AI overview The article discusses dependently typed languages such as Coq, Rocq, and Lean, which can encode subtle invariants in a type system. It explains that writing and checking proofs can require substantial effort, contributing to the niche status of these languages and motivating attempts to automate proof obligations. ### Source excerpt I've long had a soft spot for dependently-typed languages like Coq Rocq and Lean. They offer the possibility of a type system capable of encoding and enforcing arbitrarily subtle invariants. The sort of thing that, in regular languages, ends up (at best) as a comment, and which quickly gets lost as the size of the team grows. Then you get subtle misunderstandings and components that don't quite fit together. It's often the case that those components have grown to a sufficient size that, when the problem is noticed, aligning either of them is a wearying prospect. Perhaps, say dependent types seductively, you could write those invariants formally and have a machine check them. (p.s. Coq changed its name! I remember many years ago at a Coq conference in Princeton, I tried suggesting that, in an English-speaking world, having a programming language called Coq was an impediment. I don't think the audience agreed at the time. I also joked that many of the talks there sounded like a speech by Tyrion Lannister, there being so many Coqs and Hoares. A joke that was hilarious and timely, even though it fell completely flat, coming as it did before the final season of that show and our collective memory-holing of it.) The problem has always been that with great type-system power comes great proof effort. I can certainly attest to entire days spent proving really quite simple things. Doing proofs is actually quite fun: it's challenging, interactive, and there's a clear goal. But gosh, does it take a lot of time, especially if, like me, you don't know what you're doing. There's also the periodic, galling experience, at the end of many hours of effort, where you realise that the goal that you're trying to prove is, in fact, false. The classic result here is the retrospective from the seL4 effort that found that, even though the project was large enough for the engineers to develop considerable experience, they spent about 10 times as much time proving as they did designing and imp ## Profunctor Optics DevFeed: [Profunctor Optics]() Original publisher: [Read original article]() Author: Bartosz Milewski Published: 2026-07-19T11:39:02Z Content type: article Language: en Sources: [Bartosz Milewski's Programming Cafe]() Topics: [Haskell](), [Programming language](), [Programming](), [modules]() Tags: [category-theory](), [haskell](), [language](), [lens](), [mapping](), [modules](), [optics](), [profunctors](), [programming-language](), [tambara-modules]() ### AI overview This article explains profunctor optics through Tannakian reconstruction. It presents optics as a category, describes lenses and their composition in Haskell, and introduces Tambara modules as a representation that simplifies optic composition. ### Source excerpt You may think of Tannakian Reconstruction as an example of redundant encoding. It lets you replace a simple hom-set with a much more complex end that is taken over an entire functor category. Why would anyone want to do it? The answer is simple: composition! Morphisms on the left compose according to the rules of [...] ## Logic for Programmers v0.15, Livecoding DevFeed: [Logic for Programmers v0.15, Livecoding]() Original publisher: [Read original article]() Author: Hillel Wayne Published: 2026-06-17T16:40:09Z Content type: release Language: en Sources: [Newsletter feed for Hillel Wayne's Newsletter]() Topics: [releases](), [Release notes](), [JavaScript](), [Haskell]() Tags: [javascript](), [language](), [music](), [release](), [release-notes]() ### AI overview Logic for Programmers version 0.15 is described as the first true release candidate, with content complete and copy edited and proofread. The article also recommends the Strudel and CLAVIER-36 livecoding music languages discussed at a Chicago meetup. ### Source excerpt There's a new release of Logic for Programmers! This one, version 0.15, is the first true release candidate. There's a couple of minor touch-ups I need to do but all content is in and copy edited and proofread. Unless something absolutely major comes up, the next release will be 1.0 and available in print. Full release notes here. (I'm also testing if a smaller low margin PDF is better for phones and computers. The printed book is going to have much larger proper margins. Let me know what you think about this experiment!) Anyway I hurt my wrist and can't write a whole newsletter, so I'll just do a couple of recommendations. My friend Richard Whaling invited me to the inaugural livecode.chicago meetup, which was pretty cool! Among other things, people demoed two languages for livecoding music: Strudel is an extensive javascript DSL that seems relatively friendly to get into CLAVIER-36 is a ground-up special purpose language where the program is a 2D grid It all kinda makes me wish I knew the basics of music because it seems like it'd be a lot of fun to compare and contrast all of the various approaches to livecoding languages. Check em out if that's at all your thing! (For completeness, Strudel is a port of the Haskell TidalCycles and C36 was inspired by Orca) ## Why JSON and other languages should allow more flexible separators DevFeed: [Why JSON and other languages should allow more flexible separators]() Original publisher: [Read original article]() Author: Hillel Wayne Published: 2026-06-10T12:22:04Z Content type: opinion Language: en Sources: [Newsletter feed for Hillel Wayne's Newsletter]() Topics: [JSON](), [Haskell](), [Parsing]() Tags: [json](), [language](), [standard](), [transformation]() ### AI overview The article argues that requiring separators in particular positions makes common code transformations harder. Using JSON as the main example, it compares trailing, leading, and both-sided separator styles across languages including Haskell, TLA+, Prolog, Python, Go, and Alloy. ### Source excerpt This is valid JSON: { "a": 1, "b": 2, "c": 3 } This is invalid JSON: { "a": 1, "b": 2, "c": 3, } The difference is the last comma. The JSON grammar specifies that a comma can separate two members of an object but not postcede ("trail") a member. I think this was a design mistake. Say we want to add two new keys to the struct, one before the "a" member and one after the "c" member. Here's what it would look like if trailing commas were permitted: { + "x": 0, "a": 1, "b": 2, "c": 3, + "y": 4, } It's the exact same text transformation regardless of where we add the key. In the current model, we instead have this: { + "x": 0, "a": 1, "b": 2, - "c": 3 + "c": 3, + "y": 4 } Those are different transformations! Similarly if you want to remove an element, you can't just delete the corresponding line1, you have to delete the line and then check that the last line doesn't have a trailing comma. Don't even get me started on all the special cases involved in swapping two lines. JSON isn't the only language with this problem. Haskell writes record types like this: -- from https://play.haskell.org/ data Drone = Drone { xPos :: Int , yPos :: Int , zPos :: Int } This "partial bullet point" style of putting separators at the beginning of rows makes it easier to change the last row but harder to change the first one. TLA+ has this problem too: \* both valid VARIABLES a, b, c vars == <> \* both invalid VARIABLES a, b, c, vars == <> This one's annoying because 1) you're constantly adding new top-level variables while working on a spec and 2) the PlusCal DSL does not have this problem: \* Totally fine! (*--algorithm foo { variables a; b; c; The worst offenders, IMO, are logic languages like Prolog. Not only don't you have trailing separators, you have a special terminating symbol: foo(A, B, C) :- A = 1, % comma B = 2, % comma C = 3. % period! I guess you can sort of think of it as funny-lookin' braces: foo(A, B, C) :- A = 1, B = 2, C = 3 . But this is not standard synt ## Same-Day Model Integration: ESMC + ESMFold2 in Sheaf v0.11 DevFeed: [Same-Day Model Integration: ESMC + ESMFold2 in Sheaf v0.11]() Original publisher: [Read original article]() Published: 2026-05-27T00:00:00Z Content type: article Language: en Sources: [Alex Korbonits]() Topics: [Large Language Model](), [structure](), [Pydantic](), [backends](), [unit tests](), [Serverless]() Tags: [backend](), [claude-code](), [code](), [language](), [model](), [pypi](), [release](), [serverless](), [structure](), [tests]() ### AI overview The article explains how Sheaf v0.11 integrated ESMC and ESMFold2 on the same day they were released. It attributes the rapid integration to existing typed serving contracts and infrastructure, while describing verification, testing, H100 smoke testing, release work, and documentation. ### Source excerpt Chan Zuckerberg Biohub released a new protein language model and structure predictor this morning. Sheaf v0.11 shipped with both, same day. The story is less about hustle and more about what a typed serving contract buys you when a new model lands. ## Genie Lessons from Genie Sessions: Prose as a Programming Language DevFeed: [Genie Lessons from Genie Sessions: Prose as a Programming Language]() Original publisher: [Read original article]() Author: Kent Beck Published: 2026-05-26T12:47:53Z Content type: opinion Language: en Sources: [Software Design: Tidy First?]() Topics: [Programming language](), [Programming](), [Code](), [AI Agent](), [Claude Code](), [Framework](), [Filesystems]() Tags: [ai-agent](), [claude-code](), [code](), [files](), [framework](), [language](), [programming](), [programming-language]() ### AI overview Kent Beck discusses OpenProse with one of its founders and examines how structured English can be used to define programs executed by an AI agent such as Claude Code. The article describes component requirements and guarantees, service-like composition, and file-based pointers for passing large outputs between sub-agents. ### Source excerpt Kent sits down with one of the founders of OpenProse to talk through their method of prose as a programming language. ## Bjarne Stroustrup on Bell Labs and the Origins of C++ DevFeed: [Bjarne Stroustrup on Bell Labs and the Origins of C++]() Original publisher: [Read original article]() Author: Ryan Peterman Published: 2026-05-18T10:02:48Z Content type: article Language: en Sources: [The Developing Dev]() Topics: [C++](), [Programming language](), [systems](), [Unix](), [networking]() Tags: [c-plus-plus](), [language](), [networking](), [programming](), [systems]() ### AI overview A podcast interview with Bjarne Stroustrup covers his work at Bell Labs and the origins of C++. He explains that C++ combined C's low-level hardware access with Simula's class concept and higher-level programming features for systems programming. ### Source excerpt Transcript & Audio ## LLM 训练与推理的基本理解 DevFeed: [LLM 训练与推理的基本理解]() Original publisher: [Read original article]() Author: Joway Published: 2026-05-17T00:00:00Z Content type: tutorial Language: zh Sources: [Random Thoughts]() Topics: [Large Language Model](), [Language models](), [Transformer]() Tags: [embedding](), [encoding](), [language](), [large-language-model](), [llm](), [model](), [query](), [tech](), [token](), [value]() ### AI overview This Chinese tutorial explains foundational LLM training and inference concepts, including vector operations, linear layers, Softmax, LayerNorm, tokenization, token IDs, BPE, token and positional embeddings, and the initial steps of self-attention using Q, K, and V vectors. ### Source excerpt 学习一个技术最好的方式就是能够写一片文章把这个技术的原理解释清楚，本文记录了我在阅读 《Build a Large Language Model (From Scratch)》一书以及和 Claude Code 对话过程中的笔记，仅供参考。 术语解释 向量点积 定义：向量点积为标量 a = (a1, a2, a3) b = (b1, b2, b3) a - b = a1*b1 + a2*b2 + a3*b3 几何意义： a - b = |a| |b| cos(theta) 其中 theta 是两个向量的夹角。 ## Crystal 1.19.2 is released! DevFeed: [Crystal 1.19.2 is released!]() Original publisher: [Read original article]() Author: Julien Portalier Published: 2026-04-27T00:00:00Z Content type: release Language: en Sources: [Crystal]() Topics: [Crystal](), [releases](), [changelog](), [Development](), [HTTP]() Tags: [changelog](), [contributors](), [github](), [installation](), [language](), [regression](), [release](), [releases](), [support]() ### AI overview Crystal 1.19.2 is a patch release that fixes two regressions. It includes three changes since Crystal 1.19.1, updates HTTP parsing behavior to reject requests containing both conflicting headers, and fixes a regression that could eventually cause loss of randomness. Pre-built packages are available through GitHub Releases and official distribution channels. ### Source excerpt We are announcing a new Crystal release 1.19.2 with two regressions fixed. ## How Fountain keeps code generation on track for browser-based mobile games DevFeed: [How Fountain keeps code generation on track for browser-based mobile games]() Original publisher: [Read original article]() Published: 2026-03-27T07:00:00Z Content type: article Language: en Sources: [Mary Rose Cook]() Topics: [AI-assisted coding](), [Code](), [Mobile](), [WebGL](), [ui](), [Canvas](), [browser]() Tags: [agent](), [browser](), [bugs](), [canvas](), [code](), [code-generation](), [computer](), [developer](), [graphics](), [interface](), [language](), [model](), [render](), [tool](), [user-interface](), [vector](), [webgl]() ### AI overview The author describes Fountain, a game-making tool that uses a predefined framework, built-in systems, manipulable user interfaces, and a constrained target domain to keep generated code aligned while creating simple mobile arcade games. ### Source excerpt About nine months ago, my son said he wanted to make a video game. He said it was called Exploding Kitties. We made it together on my computer. He described the gameplay and drew the graphics. I vibed the code. The game basically worked. But we had to build it in small pieces. And, periodically, I had to spend time in the guts of the code, getting it back on the rails. Unifying two ways of doing the same thing. Fixing gnarlier bugs. Disentangling the game code from the engine. Today, I know that we'd be able to one-shot Exploding Kitties. The first reason: models and agent harnesses produce much higher intelligence. But, the second reason, the one I want to talk about, is the supporting techniques and environment. I've built a new game-making tool called Fountain. You can one-shot any simple mobile arcade game. Or, you can iterate your way to a more complex game and the code stays on the rails over many turns. Here's why it works - A framework that supplies decisions and built-ins Every game is given a game framework upfront. This framework encodes many decisions. That game entities have a certain data shape. That behavior abstraction is done with prototypal inheritance. That the coordinates of an entity represent its top left. This keeps the code generation aligned. And this framework includes generally useful built-ins. An update/event/draw loop. A WebGL canvas render surface. A collision detection and resolution system. A particle system. A system to detect input. This reduces the amount of code that must be generated. A manipulable artifact Prompting can be tiresome. Language is ambiguous. The model can interpret a prompt in a way the game designer didn't intend, and make the wrong change. Language is clumsy. It's hard to precisely indicate any point in a continuum. A color. A point. An amount. But there's a solution. Do it the old way. Give the game developer a user interface through which to express their intent. A color picker to choose the color of the water ## Official Experimental Java 17 Support for Codename One Projects DevFeed: [Official Experimental Java 17 Support for Codename One Projects]() Original publisher: [Read original article]() Author: Shai Almog Published: 2026-03-14T00:00:00Z Content type: release Language: en Sources: [CodeName One]() Topics: [Java](), [toolchain]() Tags: [experimental](), [java](), [jdk](), [language](), [release](), [toolchain]() ### AI overview Codename One projects generated with the Initializr now have official experimental support for Java 17. The support covers selected Java 17 language features and most targets, while desktop and UWP targets have limitations. Record support is planned for Codename One 7.0.229 on March 20, 2026, and newer language levels are planned for a future update. ### Source excerpt Codename One projects generated with the Initializr can now use official experimental Java 17 support, with record support arriving in Codename One 7.0.229 on March 20, 2026, and more JDK support planned next. ## Operation "Fish Food": Russia-origin content farm activity DevFeed: [Operation "Fish Food": Russia-origin content farm activity]() Original publisher: [Read original article]() Published: 2026-02-01T00:00:00Z Content type: article Language: en Sources: [OpenAI News]() Topics: [Artificial Intelligence](), [ChatGPT](), [OpenAI](), [Open Source](), [Internet]() Tags: [ai](), [case-study](), [chatgpt](), [language](), [openai](), [report](), [safety](), [social-media](), [telegram]() ### AI overview OpenAI reports banning ChatGPT accounts linked to the Rybar network in an operation it called Fish Food. The accounts used AI to generate multilingual content, social media comments, and Sora videos for dissemination across websites and social platforms. OpenAI says some accounts likely originated in Russia and that it could not independently confirm how all generated content was posted. ### Source excerpt OpenAI banned accounts linked to the Rybar network, some of which likely originated in Russia, that used AI to support multilingual influence activity across websites and social platforms. ## My Gripes with Prolog DevFeed: [My Gripes with Prolog]() Original publisher: [Read original article]() Author: Hillel Wayne Published: 2026-01-14T16:48:51Z Content type: opinion Language: en Sources: [Newsletter feed for Hillel Wayne's Newsletter]() Topics: [Programming](), [Code]() Tags: [code](), [language](), [programming]() ### AI overview An opinion article outlines the author's frustrations with Prolog while preparing sections on Answer Set Programming and Constraint Logic Programming. It discusses incompatible string implementations, the absence of functions, limited collection types, and the lack of boolean values, while acknowledging Prolog's bidirectionality as a useful feature. ### Source excerpt For the next release of Logic for Programmers, I'm finally adding the sections on Answer Set Programming and Constraint Logic Programming that I TODOd back in version 0.9. And this is making me re-experience some of my pain points with Prolog, which I will gripe about now. If you want to know more about why Prolog is cool instead, go here or here or here or here. No standardized strings ISO "strings" are just atoms or lists of single-character atoms (or lists of integer character codes). The various implementations of Prolog add custom string operators but they are not cross compatible, so code written with strings in SWI-Prolog will not work in Scryer Prolog. No functions Code logic is expressed entirely in rules, predicates which return true or false for certain values. For example if you wanted to get the length of a Prolog list, you write this: ?- length([a, b, c], Len). Len = 3. Now this is pretty cool in that it allows bidirectionality, or running predicates "in reverse". To generate lists of length 3, you can write length(L, 3). But it also means that if you want to get the length a list plus one, you can't do that in one expression, you have to write length(List, Out), X is Out+1. For a while I thought no functions was necessary evil for bidirectionality, but then I discovered Picat has functions and works just fine. That by itself is a reason for me to prefer Picat for my LP needs. (Bidirectionality is a killer feature of Prolog, so it's a shame I so rarely run into situations that use it.) No standardized collection types besides lists Aside from atoms (abc) and numbers, there are two data types: Linked lists like [a,b,c,d]. Compound terms like dog(rex, poodle), which seem like record types but are actually tuples. You can even convert compound terms to linked lists with =..: ?- L =.. [a, b, c]. L = a(b, c). ?- a(b, c(c)) =.. L. L = [a, b, c(c)]. There's no proper key-value maps or even struct types. Again, this is something that individual distributions c ## Ten years DevFeed: [Ten years]() Original publisher: [Read original article]() Published: 2025-12-11T00:00:00Z Content type: opinion Language: en Sources: [OpenAI News]() Topics: [OpenAI](), [Artificial Intelligence](), [systems](), [Reinforcement learning](), [Language models]() Tags: [ai](), [company](), [deep-learning](), [language](), [openai](), [reinforcement-learning](), [research]() ### AI overview OpenAI reflects on its first ten years, describing its early research culture, breakthroughs in deep learning and reinforcement learning, and work toward building AI systems that benefit humanity. The article also discusses lessons from the organization's development and its continued optimism about its mission. ### Source excerpt OpenAI reflects on ten years of progress, from early research breakthroughs to widely used AI systems that reshaped what's possible. We share lessons from the past decade and why we remain optimistic about building AGI that benefits all of humanity. ## Lazy Linearity for a Core Functional Language (POPL 2026) DevFeed: [Lazy Linearity for a Core Functional Language (POPL 2026)]() Original publisher: [Read original article]() Published: 2025-11-26T00:00:00Z Content type: article Language: en Sources: [Romes' Musings]() Topics: [Haskell](), [Compiler]() Tags: [compiler](), [evaluation](), [functional](), [haskell](), [language](), [optimisations](), [paper](), [types]() ### AI overview The article announces that the paper "Lazy Linearity for a Core Functional Language" will be published at POPL 2026. It explains a type system that captures linearity under Haskell's non-strict evaluation and is intended to support optimisations of linear Core programs. ### Source excerpt I'm very proud to announce that Lazy Linearity for a Core Functional Language, a paper by myself and Bernardo Toninho, will be published at POPL 26! [DOI, ACM]. The extended version of the paper, which includes all proofs, is available here [arXiv, PDF, DOI]. The short-ish story: In 2023, for my Master's thesis, I reached out to Arnaud Spiwack to discuss how Linear Types had been implemented in GHC. I wanted to research compiler optimisations made possible by linearity. Arnaud was quick to tell me: "Well yes, but you can't!" "Even though Haskell is linearly typed, Core isn't!"1 Linearity is ignored in Core because, as soon as it's optimised, previously valid linear programs become invalid. It turns out that traditional linear type systems are too syntactic, or strict, about understanding linearity - but Haskell, regardless of linear types, is lazily evaluated. Improving optimisations would have to wait. Our paper presents a system which, in contrast, also accepts programs that can only be understood as linear under non-strict evaluation. Including the vast majority of optimised linear Core programs (with proofs!). The key ideas of this paper were developed during my Master's, but it took a few more years of on-and-off work (supported by my employer Well-Typed) with Bernardo to crystalize the understanding of a "lazy linearity" and strengthen the theoretical results. Now, the proof of the pudding is in the eating. Go read it! Abstract Traditionally, in linearly typed languages, consuming a linear resource is synonymous with its syntactic occurrence in the program. However, under the lens of non-strict evaluation, linearity can be further understood semantically, where a syntactic occurrence of a resource does not necessarily entail using that resource when the program is executed. While this distinction has been largely unexplored, it turns out to be inescapable in Haskell's optimising compiler, which heavily rewrites the source program in ways that break syntactic l ## Compiling a Call to a Block DevFeed: [Compiling a Call to a Block]() Original publisher: [Read original article]() Author: Pat Shaughnessy Published: 2025-11-03T00:00:00Z Content type: tutorial Language: en Sources: [Pat Shaughnessy]() Topics: [Ruby](), [Compiler](), [Parser](), [Code](), [Programming]() Tags: [code](), [compiler](), [language](), [ruby](), [syntax](), [updating-ruby-under-a-microscope]() ### AI overview An excerpt from a revised edition of Ruby Under a Microscope explains how Ruby's compiler handles a call to the 10.times method with a block. It examines the Prism parser's redesigned abstract syntax tree and the corresponding YARV instruction generation. ### Source excerpt I've started working on a new edition of Ruby Under a Microscope that covers Ruby 3.x. I'm working on this in my spare time, so it will take a while. Leave a comment or drop me a line and I'll email you when it's finished. This week's excerpt ## Nemotron-Personas-India: Synthesized Data for Sovereign AI DevFeed: [Nemotron-Personas-India: Synthesized Data for Sovereign AI]() Original publisher: [Read original article]() Author: Kiran Praveen; Utkarsh Vaidya; Evan A; Lipika Ramaswamy; Dhruv Nathawani; Dane Corneil; Yev Meyer Published: 2025-10-13T23:00:42Z Content type: article Language: en Sources: [Hugging Face - Blog]() Topics: [Artificial Intelligence](), [Synthetic Data Generation](), [synthetic-data](), [datasets](), [Sovereign AI](), [NeMo](), [Nemotron](), [LLMs]() Tags: [ai](), [ai-adoption](), [data](), [datasets](), [evaluation](), [generation](), [india](), [language](), [llms](), [model](), [models](), [nemo](), [nemotron](), [nvidia](), [open-source](), [synthetic](), [synthetic-data](), [synthetic-data-generation]() ### AI overview NVIDIA releases Nemotron-Personas-India, an open synthetic dataset of Indic personas designed to address the lack of multilingual and culturally representative data for Indian AI systems. Built with NeMo Data Designer and licensed under CC BY 4.0, it contains 21 million personas across English and Hindi in Devanagari and Latin scripts, with demographic, geographic, occupational, and cultural attributes. ### Source excerpt India represents one of the world's largest AI opportunities -- with over 700 million internet users, a multitude of languages, and a rapidly growing developer ecosystem. Yet, most open datasets reflect Western norms and English-only contexts, creating a data gap that limits AI adoption in India's multilingual, multi-script environment. ## Cangjie -- a programming language from Huawei DevFeed: [Cangjie -- a programming language from Huawei]() Original publisher: [Read original article]() Author: Jasper Morgan Published: 2025-08-19T07:37:53Z Content type: opinion Language: en Sources: [Snapp Mobile - Medium]() Topics: [Programming language](), [huawei](), [Programming](), [Code](), [Embedded Systems](), [Cross-Compilation](), [Mobile](), [cloud-computing](), [Package Management](), [debug](), [Testing](), [ide]() Tags: [architectures](), [bytecode](), [cangjie](), [china](), [cloud](), [cross-compilation](), [debugging](), [developers](), [development](), [embedded-systems](), [huawei](), [huawei-developers](), [language](), [mobile](), [package-management](), [programming](), [programming-language](), [programming-languages](), [tools]() ### AI overview This article examines Cangjie, an open-sourced programming language from Huawei. It describes Cangjie as a C-like language with features associated with Swift and Kotlin, support for embedded systems, mobile development, and cloud architectures, interoperability with C and Python, JVM bytecode compilation, cross-compilation, and integrated developer tools. The article suggests Huawei created it to gain more control over its language roadmap and consolidate development skills across products. ### Source excerpt Cangjie -- a programming language from Huawei Huawei have been busy. Last month they open-sourced a programming language that is looking pretty interesting. Whilst you might not be writing in Cangjie next week, it's good to see what one of the world's largest technology companies is doing such that they have created a new programming language. TL;DR Cangjie is a C-like programming language that feels more like Swift/Kotlin than Java/C# or JavaScript/Typescript. The idea is for Cangjie to become the common programming language to be used throughout Huawei. Cangjie can be used for embedded systems, mobile development, server-side cloud architectures. It supports a variety of programming paradigms (function, OO, procedural), compilation and integration options. Cangjie can call C libraries (and be called from C), use Python libraries and even compile to JVM bytecode. Cangjie supports language extension to create lightweight DSLs. Primarily Cangjie programs are compiled into machine code -- this include cross compilation which mean they can run natively on different computer architectures. Cangjie comes with a set of in-built tools for developers such as package management, debugging, testing and IDE integration. Cangjie is openly available since this month and is in version 0.53.13. Why create a new language? Simply put, Cangjie gives Huawei a level of control and an economy of scale that they cannot get from other languages. Most mainstream languages are driven predominantly by teams in USA and Europe. It is hard to influence the road map for these languages -- especially for those tightly controlled by corporations (e.g. Java/Kotlin/Swift). Furthermore, consolidating programming skills could be a big efficiency gain for Huawei -- engineers working on products ranging from routers to petabyte storage to cloud computing and mobile devices can coalesce around one language and toolset. Show me some code I won't go into any detail here so this is just to satisfy your curiosit ## Post-Quantum Cryptography Proof of Concept Implementations DevFeed: [Post-Quantum Cryptography Proof of Concept Implementations]() Original publisher: [Read original article]() Published: 2025-07-20T21:35:33Z Content type: tutorial Language: en Sources: [Signs of Triviality]() Topics: [Post-Quantum](), [Post-quantum cryptography](), [QUIC](), [TLS (Transport Layer Security)](), [Server](), [client]() Tags: [client](), [cryptography](), [language](), [post-quantum](), [post-quantum-cryptography](), [quantum](), [quic](), [server](), [tls]() ### AI overview The article presents a few QUIC post-quantum cryptography TLS server implementations intended to help verify client and language capabilities. ### Source excerpt A few quic PQC TLS server implekentations to help you verify client and language capabilities. ## Go's adoption and relevance for developers DevFeed: [Go's adoption and relevance for developers]() Original publisher: [Read original article]() Published: 2025-06-25T00:00:00Z Content type: opinion Language: en Sources: [Gaurav Sarma's Blog]() Topics: [Go Language](), [Docker](), [Kubernetes](), [Terraform]() Tags: [adoption](), [career](), [docker](), [future](), [go](), [kubernetes](), [language](), [tech](), [terraform]() ### AI overview The article argues that Go is a strong language choice for experienced developers because its adoption by companies and use in projects such as Kubernetes, Docker, and Terraform indicate continuing relevance. ### Source excerpt Original Tweet - https://x. com/sarmag77/status/1948641731966369923 Back in 2018-2019, Go experienced a spike massive adoption with popular projects like Kubernetes, Docker, Terraform... [Next page]()