Programming Languages

1151 readers

2 users here now

Hello!

This is the current Lemmy equivalent of https://www.reddit.com/r/ProgrammingLanguages/.

The content and rules are the same here as they are over there. Taken directly from the /r/ProgrammingLanguages overview:

This community is dedicated to the theory, design and implementation of programming languages.

Be nice to each other. Flame wars and rants are not welcomed. Please also put some effort into your post.

This isn't the right place to ask questions such as "What language should I use for X", "what language should I learn", and "what's your favorite language". Such questions should be posted in /c/learn_programming or /c/programming.

This is the right place for posts like the following:

"Check out this new language I've been working on!"
"Here's a blog post on how I implemented static type checking into this compiler"
"I want to write a compiler, where do I start?"
"How does the Java compiler work? How does it handle forward declarations/imports/targeting multiple platforms/?"
"How should I test my compiler? How are other compilers and interpreters like gcc, Java, and python tested?"
"What are the pros/cons of ?"
"Compare and contrast vs. "
"Confused about the semantics of this language"
"Proceedings from PLDI / OOPSLA / ICFP / "

See /r/ProgrammingLanguages for specific examples

Related online communities

founded 1 year ago

MODERATORS

armchair_progamer@programming.dev

Forsp: A Forth+Lisp Hybrid Lambda Calculus Language (xorvoid.com)

submitted 3 months ago* (last edited 3 months ago) by armchair_progamer@programming.dev to c/programming_languages@programming.dev

0 comments fedilink hide all child comments

Forsp has:

An S-Expression syntax like Lisp

Function abstraction like Lisp

Function application like Forth

An environment structure like Lisp

Lexically-scoped closures like Lisp (Scheme)

Cons-cells / lists / atoms like Lisp

A value/operand stack like Forth

An ability to express the Lambda Calculus

A Call-By-Push-Value evaluation order

Only 3 syntax special forms: ' ^ $

Only 1 eval-time special form: quote

Only 10 primitive functions need to self-implement

Ability to self-implement in very little code

It's evaluator is very simple. I suspect simpler than a McCarthy Lisp eval() function, but I haven't defined a "simplicity function", so you can be the judge.

In contrast to Lisp, apply() is trivial in Forsp, and instead we have a core function called compute()

GitHub

no comments (yet)

sorted by: hot top controversial new old

there doesn't seem to be anything here