~lobsters | Bookmarks (81)

clear filters

plt ×

Zest: syntax

scattered-thoughts.net

plt
1
The BLISS programming language: a history (2002)

tufts.edu

historical pdf plt
1
Inko 0.14.0 released

inko-lang.org

plt programming
1
Lambda to SKI, semantically

okmij.org

pdf plt
1
Advent of Code 2023: Day 6 — flowblok’s blog

flowblok.id.au

Hurl is a dynamically-typed programming language that uses exception handling as its only form of control...
Hurl is a dynamically-typed programming language that uses exception handling as its only form of control flow. Much of the syntax is unsurprising, but the forms of exception raising and handling deserve close examination. Here is the canonical way to do conditional branches in Hurl: try { hurl 1 < 2; } catch (true)...

plt satire
1
If Inheritance is so bad, why does everyone use it?

buttondown.email

plt
2
OR-types

liquidex.house

last night I couldn't fall asleep because I was thinking how sites like Anilist implement their...
last night I couldn't fall asleep because I was thinking how sites like Anilist implement their tag-based search systems. my mind was racing, and with enough thinking about scores and weights and sums and products… I arrived at the topic of sum types and product types. I was thinking, "this is actually really intere...

plt
1
Chapel 2.0: Scalable and Productive Computing for All

chapel-lang.org

plt release
2
XXIIVV — modal

xxiivv.com

plt programming
1
43 Years of Actors: A Taxonomy of Actor Models and Their Key Properties (2016)

vub.ac.be

The Actor Model is a message passing concurrency model that was originally proposed by Hewitt et...
The Actor Model is a message passing concurrency model that was originally proposed by Hewitt et al. in 1973. It is now 43 years later and since then researchers have explored a plethora of variations on this model. This paper presents a history of the Actor Model throughout those years. The goal of this paper is not to provide an exhaustive overview of every...

pdf plt
1
Type Inference Was a Mistake

borretti.me

plt
2
jank development update - Syntax quoting!

jank-lang.org

Oh, hey folks. I was just wrapping up this macro I was writing. One moment.(defmacro if-some...
Oh, hey folks. I was just wrapping up this macro I was writing. One moment.(defmacro if-some [bindings then else] (assert-macro-args (vector? bindings) "a vector for its binding" (= 2 (count bindings)) "exactly 2 forms in binding vector") (let [form (get bindings 0) pred (get bindings 1)] `(let [temp# ~pred] (if (ni...

c++clojure plt
1
Why do (or don't) languages forbid unreachable code?

stackexchange.com

plt
1
Fledgling Languages List - New and upcoming programming languages

presidentbeef.com

plt
1
Reactive Programming without Functions

programming-journal.org

plt
2
Learn Lil in 10 Minutes

beyondloom.com

plt
1
The Montréal Effect: Why Programming Languages Need a Style Czar

earthly.dev

Here is a non-realistic scenario: You are choosing the programming language for what will eventually become...
Here is a non-realistic scenario: You are choosing the programming language for what will eventually become something large. Picture a collection of services in a mono repo, with over 100 people working on it. To keep this extra unrealistic, let’s say you’re ignoring the usual constraints, like whether you can affor...

plt
3
Abstracting Denotational Interpreters

arxiv.org

Abstracting Denotational Interpreters | Sebastian Graf, Simon Peyton Jones, Sven Keidel Abstract We explore denotational interpreters:...
Abstracting Denotational Interpreters | Sebastian Graf, Simon Peyton Jones, Sven Keidel Abstract We explore denotational interpreters: denotational semantics that produce coinductive traces of a corresponding small-step operational semantics. By parameterising our denotational interpreter over the semantic domain and then varying it, we recover dynamic semantics with different evaluation strategies as well as summary-based static analyses such as type analysis, all from the same generic...

plt
1
Type Unions Don't Always Compose Well

rtpg.co

plt
2
A visual introduction and software to Abstract Geometrical Computation and signal machines

univ-orleans.fr

Here are two examples of the dynamics of signals machines. The left one is a random...
Here are two examples of the dynamics of signals machines. The left one is a random machine while the right one is designed as a never-ending divide and conquer. This dynamics system was devised for for Habilitation à Diriger des Recherches (Durand-Lose, 2003) and has been investigated since. In 2014, these research...

math plt
1
I'm betting on Call-by-Push-Value

thunderseethe.dev

You come upon a function argument at a fork in the road. If it takes the...
You come upon a function argument at a fork in the road. If it takes the left road, it’ll evaluate itself and then be passed to its function. If it takes the right road, it’ll pass itself to the function to be evaluated somewhere down the road (🥁🐍). Let’s bet on which road will be faster.We might suspect this is a r...

call-by-name call-by-need call-by-value eager lazy
2
Extending destination-passing style programming to arbitrary data types in Linear Haskell

tweag.io

Three years ago, a blog post introduced destination-passing style (DPS) programming in Haskell, focusing on array...
Three years ago, a blog post introduced destination-passing style (DPS) programming in Haskell, focusing on array processing, for which the API was made safe thanks to Linear Haskell. Today, I’ll present a slightly different API to manipulate arbitrary data types in a DPS fashion, and show why it can be useful for s...

haskell plt
1
Towards zero-downtime upgrades of stateful systems

stevana.github.io

distributed plt
2
Dada | Dada

dada-lang.org

plt rust
2