A verified staged interpreter is a verified compiler

Brady, Edwin; Hammond, Kevin

doi:10.1145/1173706.1173724

Cited by 26 publications

(30 citation statements)

References 25 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The implementation of Effects follows a common pattern in dependently typed DSL implementation, that of the well-typed interpreter [2,6,24]. We describe the DSL as a data type, EffM, which expresses the properties a program must satisfy in its type, with a corresponding interpreter.…”

Section: The Effects Dsl Implementationmentioning

confidence: 99%

Programming and reasoning with algebraic effects and dependent types

Brady

2013

Proceedings of the 18th ACM SIGPLAN International Conference on Functional Programming

Self Cite

View full text Add to dashboard Cite

One often cited benefit of pure functional programming is that pure code is easier to test and reason about, both formally and informally. However, real programs have side-effects including state management, exceptions and interactions with the outside world. Haskell solves this problem using monads to capture details of possibly side-effecting computations -it provides monads for capturing State, I/O, exceptions, non-determinism, libraries for practical purposes such as CGI and parsing, and many others, as well as monad transformers for combining multiple effects.Unfortunately, useful as monads are, they do not compose very well. Monad transformers can quickly become unwieldy when there are lots of effects to manage, leading to a temptation in larger programs to combine everything into one coarse-grained state and exception monad. In this paper I describe an alternative approach based on handling algebraic effects, implemented in the IDRIS programming language. I show how to describe side effecting computations, how to write programs which compose multiple fine-grained effects, and how, using dependent types, we can use this approach to reason about states in effectful programs.

show abstract

Section: The Effects Dsl Implementationmentioning

confidence: 99%

Programming and reasoning with algebraic effects and dependent types

Brady

2013

Proceedings of the 18th ACM SIGPLAN International Conference on Functional Programming

Self Cite

View full text Add to dashboard Cite

show abstract

“…Staging As discussed in the introduction, our meta-programming primitives do not use the concept of staging like some other solutions [6,11,48,52]. Nevertheless, our interp primitive performs the same function as an unquote primitive in such systems, allowing object programs to invoke a meta-program and use generated code as if it were normal code.…”

Section: Soundnessmentioning

confidence: 99%

Typed syntactic meta-programming

Devriese

Piessens

2013

Proceedings of the 18th ACM SIGPLAN International Conference on Functional Programming

View full text Add to dashboard Cite

We present a novel set of meta-programming primitives for use in a dependently-typed functional language. The types of our metaprograms provide strong and precise guarantees about their termination, correctness and completeness. Our system supports typesafe construction and analysis of terms, types and typing contexts. Unlike alternative approaches, they are written in the same style as normal programs and use the language's standard functional computational model. We formalise the new meta-programming primitives, implement them as an extension of Agda, and provide evidence of usefulness by means of two compelling applications in the fields of datatype-generic programming and proof tactics.

show abstract

“…The well-typed interpreter [1,7,20] for a simple functional language is commonly used to illustrate the key concepts of dependently-typed programming. Here, the type system ensures that only well-typed source programs can be represented and interpreted.…”

Section: The Well-typed Interpretermentioning

confidence: 99%

Resource-Safe Systems Programming with Embedded Domain Specific Languages

Brady

Hammond

2012

Practical Aspects of Declarative Languages

Self Cite

View full text Add to dashboard Cite

Abstract. We introduce a new overloading notation that facilitates programming, modularity and reuse in Embedded Domain Specific Languages (EDSLs), and use it to reason about safe resource usage and state management. We separate the structural language constructs from our primitive operations, and show how precisely-typed functions can be lifted into the EDSL. In this way, we implement a generic framework for constructing state-aware EDSLs for systems programming.

show abstract

A verified staged interpreter is a verified compiler

Cited by 26 publications

References 25 publications

Programming and reasoning with algebraic effects and dependent types

Programming and reasoning with algebraic effects and dependent types

Typed syntactic meta-programming

Resource-Safe Systems Programming with Embedded Domain Specific Languages

Contact Info

Product

Resources

About