211
Mir: A lightweight JIT compiler project
Take an in-depth look at the MIR lightweight JIT compiler project's goals and state of development, such as the addition of support for CRuby.
212
A Few More Reasons Rust Compiles Slowly
Learn about the benefits of TiDB and the TiDB Cloud solutions from PingCAP. Read our latest post "A Few More Reasons Rust Compiles Slowly" here.
213
Stacked Borrows: An Aliasing Model for Rust
Type systems are useful not just for the safety guarantees they provide, but also for helping compilers generate more efficient code by simplifying important program analyses. In Rust, the type system imposes a strict discipline on pointer aliasing, and it is an express goal of the Rust compiler developers to make use…
214
215
Parse, don’t type-check
There’s a fantastic article from last year titled Parse, don’t validate. I’d highly recommend it to any programmer (along with the more recent follow up Names are not type safety). The basic idea i…
216
Named arguments are coming in PHP 8
A close look at named parameters in PHP 8
217
K Language (2011)
Forthcoming events See all events... News Administration Files Buyer Profile Jobs Tenure Procedures Attestation Documents To the Prize page Please donate BIC: UNCRBGSF IBAN: BG32UNCR76303100117336 Address: Institute of Mathematics and
218
Cakelisp: A Programming Language for Games
Update: See the Hacker News thread , /r/programming , /r/ProgrammingLanguages , /r/gamedev , and /r/lisp posts for discussions on this article and Cakelisp.
219
Getting started with Rust by building a tiny Markdown compiler
Jelajahi katalog produk dan informasi lengkap dari PANEN99.
220
Hindley-Milner Type Inference (2012)
Robin Milner's type system with parametric polymorphism was a significant advance over the systems of Russell and Church. Arguably it is the ability to use type-variables that makes higher order logic a practical vehicle for proving non-trivial theorems. The Hindley-Milner algorithm is used to automatically infer…
221
Three Months of Go from a Haskeller’s perspective (2016)
This summer I’ve been interning at Pusher , and have been writing a lot of Go. It’s been a bit of a change coming from a Haskell background, so I decided to write up my thoughts now, at the end.
222
223
Which Parsing Approach?
We all know that parsing is an important part of designing and implementing programming languages, but it’s the equivalent of Brussels sprouts: good for the diet, but a taste that only a select few enjoy. Unfortunately, I’ve come to realise that our general distaste for parsing is problematic. While many of us think…
224
225
An in-depth look at OCaml’s new “best-fit” garbage collector strategy
An in-depth Look at OCaml’s new "Best-fit" Garbage Collector Strategy The Garbage Collector probably is OCaml’s greatest unsung hero. Its pragmatic approach allows us to allocate without much fear of efficiency loss. In a way, the fact that most OCaml hackers know little about it is a good sign:...
226
227
Announcing TypeScript 3.9
Today we're excited to announce the release of TypeScript 3.9! If you're unfamiliar with TypeScript, it's a language that builds on JavaScript by adding
228
F (2006)
F is a pure functional concatenative language originally designed as an extension of False . F contains the list-operations of K3 and the dip combinator of Joy . Floating-point and symbolic datatypes are supported. One-time assignment is enforced in syntax. A theory of function-valence and -charge is outlined. F also…
229
SBCL: New in Version 2.1.0
New SBCL versions are usually released at the end of each month: check the Sourceforge File List to see the current version. The new features of all SBCL releases are listed below.
230
Game of Life in one Ruby statement inspired by APL
Well, the title says it all!
231
Back to old tricks, or, baby steps in Rust
I’ve been learning Rust for the past twenty days or so, working through the Blandy & Orendorff book, coding up things as I go. Once I got into playing with Rust traits and closures and as…
232
Where Did Combinators Come From? Hunting the Story of Moses Schönfinkel
A dive into the unknown personal and academic history of the mathematician who developed combinators, Moses Schönfinkel.
233
Jane Street and the OCaml Compiler (2018) [video]
Jane Street is a quantitative trading firm and liquidity provider with a unique focus on technology and collaborative problem solving.
234
Lambda Calculus Diagrams (2015)
The following table shows diagrams of identity, the booleans, some standard combinators, some Church numerals, the predecessor function on Church numerals, and Omega. term definition diagram alternative I/1 λx.x K/true λx.λy.x false/0 λx.λy.y S λx.λy.λz.(x z)(y z) Y λf.(λx.x x)(λx.f(x x)) 2 λf.λx.f(f x) 3 λf.λx.f(f(f…
235
Go Developer Survey 2019 Results
An analysis of the results from the 2019 Go Developer Survey.
236
Racket 7.8
Racket version 7.8 is now available from https://racket-lang.org/ Racket CS may become the default Racket implementation in the next release. With the improvements in this release, Racket CS provides all of the functionality of Racket BC (the curre...
237
238
I rewrote a Clojure tool in Rust
About two years ago, I wrote a quite complicated diff tool in Clojure. It was complicated enough that I struggled to fit the algorithm in my head and the inputs were large enough that I had to make some efforts to improve performance.
239
240
Go’s Major Versioning Sucks – From a Fanboy
Learn Go (Golang) by writing real code in this interactive course. Practice structs, interfaces, errors, concurrency, and idiomatic backend patterns.