Language Workbenches offer language designers an expressive environment in which to create their Domain Specific Languages (DSLs). Similarly, research into mechanised meta-theory has shown how dependently typed languages provide expressive environments to formalise and study DSLs and their meta-theoretical properties. But can we claim that dependently typed languages qualify as language workbenches? We argue yes! We have developed an exemplar DSL called Velo that showcases not only dependently typed techniques to realise and manipulate Intermediate Representations (IRs), but that dependently typed languages make fine language workbenches. Velo is a simple verified language with well-typed holes and comes with a complete compiler pipeline:...
We propose a full-spectrum dependently typed programming language, Zombie, which supports general re...
Real world programming languages crucially depend on the availability of computational effects to ac...
Program synthesis, the automatic generation of programs from specification, promises to fundamentall...
Language Workbenches offer language designers an expressive environment in which to create their Dom...
Dependent types can make your developments (be they programs or proofs) dramatically safer by allowi...
Modern programming languages rely on advanced type systems that detect errors at compile-time. While...
We present Turnstile+, a high-level, macros-based metaDSL for building dependently typed languages. ...
Dependent type theories have a long history of being used for theorem proving. One aspect of type th...
Programming languages based on dependent type theory promise two great advances: flexibility and sec...
Language designers have in recent years proposed a wealth of richer type systems for programming whi...
Many components of a dependently typed programming language are by now well understood, for example ...
Robin Milner coined the slogan well typed programs cannot go wrong, advertising the power of types i...
The definition of type equivalence is one of the most important design issues for any typed language...
Dependent type theory is a powerful logic for both secure programming and computer assisted proving ...
Most existing programming languages provide little support to formally state and prove properties ab...
We propose a full-spectrum dependently typed programming language, Zombie, which supports general re...
Real world programming languages crucially depend on the availability of computational effects to ac...
Program synthesis, the automatic generation of programs from specification, promises to fundamentall...
Language Workbenches offer language designers an expressive environment in which to create their Dom...
Dependent types can make your developments (be they programs or proofs) dramatically safer by allowi...
Modern programming languages rely on advanced type systems that detect errors at compile-time. While...
We present Turnstile+, a high-level, macros-based metaDSL for building dependently typed languages. ...
Dependent type theories have a long history of being used for theorem proving. One aspect of type th...
Programming languages based on dependent type theory promise two great advances: flexibility and sec...
Language designers have in recent years proposed a wealth of richer type systems for programming whi...
Many components of a dependently typed programming language are by now well understood, for example ...
Robin Milner coined the slogan well typed programs cannot go wrong, advertising the power of types i...
The definition of type equivalence is one of the most important design issues for any typed language...
Dependent type theory is a powerful logic for both secure programming and computer assisted proving ...
Most existing programming languages provide little support to formally state and prove properties ab...
We propose a full-spectrum dependently typed programming language, Zombie, which supports general re...
Real world programming languages crucially depend on the availability of computational effects to ac...
Program synthesis, the automatic generation of programs from specification, promises to fundamentall...