You signed in with another tab or window. Reload to refresh your session. You signed out in another tab or window. Reload to refresh your session. You switched accounts on another tab or window. Reload to refresh your session.
You can now test Tao in the browser! A statically-typed functional language with polymorphism, typeclasses, generalised algebraic effects, sum types, pattern-matching, first-class functions, currying, good diagnostics, and much more! For more example programs, see... hello.tao: Hello world input.tao: Demonstrates a more complex example of IO effects calc.tao: A CLI calculator, demonstrating parser
A new pure functional language built on the top of Python3. Warning: this is an alpha release; the core of the interpreter is working and should give a precise idea of the language, but the provided program parses the README.md file (see the very last line of the code). This is because it should be discussed (on a mailing list) how to use the interpreter: as a standalone command line tool? as a mo
Functional languages provide a solid foundation on which complex optimization passes can be designed to exploit available parallelism in the underlying system. Their mathematical foundations enable high-level optimizations that would be impossible in traditional imperative languages. This makes them uniquely suited for generation of efficient target code for parallel systems, such as multiple Cent
Pycket: A Tracing JIT For a Functional Language Spenser Bauman, Carl Friedrich Bolz, Robert Hirschfeld, Vasily Krilichev, Tobias Pape, Jeremy Siek, and Sam Tobin-Hochstadt 2015 We present Pycket, a high-performance tracing JIT compiler for Racket. Pycket supports a wide variety of the sophisticated features in Racket such as contracts, continuations, classes, structures, dynamic binding, and more.
UPDATE: I’ve made some changes to the design! There’s an updated version of this post here. This language is gonna rock, I’m really excited about it. I’ve talked to a number of people about tulip, but this is the first I’ve sat down and written out what it’s going to look like. In particular, I owe Adam Baker a huge thanks for talking through the first version of this with me in January. So here’s
Machine Logic At the junction of computation, logic and mathematics 08 Mar 2023 [ examples inductive definitions ] The simplest way to precisely specify the meanings of programming language expressions is through an operational semantics. Such a definition consists of a set of what look like the inference rules of a logic, stating the conditions under which a given expression can be reduced to a v
High-level programming and program performance are at odds. High-level languages enable complex, pervasive abstractions, whereas high performance demands these abstractions be reduced to a minimum. Thus, an optimizing compiler is an essential part of a high-level language that seeks to accomplish both goals. However, even the most sophisticated optimizer can fall short when presented with abstract
I am providing code in this repository to you under an open source license. Because this is my personal repository, the license you receive to my code if from me and not my employer (Facebook). LinearML (or LiML) is a programming language designed to write efficient parallel programs. Its main characteristics are: * Purely functional * Statically typed * Strict evaluation order In LiML, the defaul
Feval: Parsing a functional language with Parsec How to use Parsec to parse a functional programming language In the following we will discuss how to parse the grammar x ::= ( a | b | ... | z ) ( a | b | ... | z | A | B | ... | Z | 0 | 1 | ... | 9 | _ | ' )* v ::= x | True | False | 0 | 1 | -1 | 2 | -2 | ... | Function x -> e | [] | [v, v, ..., v] e ::= v | (e) | e && e | e "||" e | !e | e + e | e
So it turns out C is a functional language too! On the way to Strange Loop this year, John Van Enk and I were trying to find a way to write some C code that avoided dynamic (malloc) allocation. We discovered a technique that allows you to forgo the use of malloc in many common cases. It also enables very pure functional C code. You doubt? I shall demonstrate! I will show how you can write a linked
For the past few months, I have been working on an experimental functional/data language called Morel. SQL has several deficiences relating to nested collections, higher-order functions and type system. After several months trying to figure out how to add these features to SQL, I noticed that they were basically the defining characteristics of a functional programming language. I figured, rather t
j次のブックマーク
k前のブックマーク
lあとで読む
eコメント一覧を開く
oページを開く