~lobsters | Bookmarks (77)

clear filters

plt ×

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
GitHub - boothby/repiet: A compiler for the esoteric language Piet, targeting multiple backends.

github.com

compilers plt
1
The siren song of domain-specific languages

haskellforall.com

I’ve seen a lot of engineering teams mistakenly believe that they can author domain-specific languages for...
I’ve seen a lot of engineering teams mistakenly believe that they can author domain-specific languages for less technical users on a budget. In particular they seem to believe that if they create this domain-specific language then the less technical users will be able to thoughtlessly churn out a bunch of code in th...

plt
1
Welcome to Claro! - The Claro Programming Language (DRAFT)

clarolang.com

plt
2
jank development update - Dynamic bindings and more!

jank-lang.org

c++clojure plt
1
Unification-free ("keyword") type checking

haskellforall.com

From my perspective, one of the biggest open problems in implementing programming languages is how to...
From my perspective, one of the biggest open problems in implementing programming languages is how to add a type system to the language without significantly complicating the implementation. For example, in my tutorial Fall-from-Grace implementation the type checker logic accounts for over half of the code. In the f...

plt
1
GitHub - williamdemeo/TypeFunc: Resources for type theory, functional programming, etc.

github.com

math plt
1
Unexplanations: query optimization works because sql is declarative

scattered-thoughts.net

plt
1
Planner programming blows my mind

hillelwayne.com

Picat is a research language intended to combine logic programming, imperative programming, and constraint solving. I...
Picat is a research language intended to combine logic programming, imperative programming, and constraint solving. I originally learned it to help with vacation scheduling but soon discovered its planner module, which is one of the most fascinating programming models I’ve ever seen. First, a brief explanation of lo...

constraint solving niche language demos picat plt raku
2
Why is Prettier rock solid?

mrmr.io

I've always wondered why Prettier is so good. Yes, it learnt from gofmt what to do...
I've always wondered why Prettier is so good. Yes, it learnt from gofmt what to do (note that gofmt doesn't indent, which is the hard part). Yes, it was announced in a real life conference, which helped get the initial momentum behind it. All that is fine, but what was a bit inexplicable to me is its quality. You mi...

haskell plt
1
Bergamot: Exploring Programming Language Inference Rules

danilafe.com

plt
1
Go (LEFT) CUE: Shifting Go left with CUE - Roger Peppe

youtube.com

devops go plt science & technology video
1
Chris's Wiki :: blog/programming/GoReflectTypeForOptimization

utoronto.ca

Go's reflect.TypeFor() is a generic function that returns the reflect.Type for its type argument. It was...
Go's reflect.TypeFor() is a generic function that returns the reflect.Type for its type argument. It was added in Go 1.22, and its initial implementation was quite simple but still valuable, because it encapsulated a complicated bit of reflect usage. Here is that implementation: func TypeFor[T any]() Type { return T...

go plt
1
From Go to Rust: The Two Types of Readable Code

earthly.dev

plt programming
2
Visualizing Packrat Parsing

dubroy.com

plt visualization
2
Maybe Everything Is a Coroutine - Adam Nelson

nels.onl

plt
1