STATUS NOTE
Peridot is no longer being maintained.
An experimental language for exploring the practical applications of two level type theory.
Discussion takes place on the r/ProgrammingLanguages Discord server in the #peridot channel.
Note: Peridot is a proof-of-concept! It is not intended for real-world use.
References and Inspiration
- REFERENCES.md: A list of prior art that have influenced Peridot’s design and implementation in major ways
Introduction
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 abstraction it was not built to deal with. As programmers develop new abstractions, a choice must be made between the following options:
- Augmenting the optimizer to deal with these new abstractions
- Abandoning performance in exchange for high-level programming
- Abandoning high-level programming in exchange for performance
Option 1 is the most attractive, as it would allow our programs to be both high-level and high-performance. Options 2 and 3 are not attractive, since we have to abandon one of the two. However, option 1 has shortcomings too! It is impractical to augment the optimizer every time a new library is developed, this would result in the compiler becoming extremely bloated. Furthermore, this forces compiler developers to have the necessary know-how to implement optimizations for a library abstraction. Ideally, the library developers would be the only ones who need this knowledge. Taking all of this into account, it makes sense why, despite their shortcomings, options 2 and 3 are often chosen. Option 1 would be extremely valuable, but it is also costly to implement.
Peridot is a language which eliminates the shortcomings of option 1 by allowing the entire compiler backend can be implemented in userspace. In fact, the compiler does not implement any built-in backend functionality at all. Every transformation and optimization in a backend pipeline – e.g CPS translation, inlining, monomorphization, constant folding, fusion, or demand analysis – can be implemented in userspace via metaprogramming. Library authors can easily implement the domain-specific optimizations they need, backend components become modular, and the compiler avoids bloat.
评论