Dependently Typed Grammars

  title={Dependently Typed Grammars},
  author={Kasper Brink and Stefan Holdermans and Andres L{\"o}h},
Parser combinators are a popular tool for designing parsers in functional programming languages. If such combinators generate an abstract representation of the grammar as an intermediate step, it becomes easier to perform analyses and transformations that can improve the behaviour of the resulting parser. Grammar transformations must satisfy a number of invariants. In particular, they have to preserve the semantics associated with the grammar. Using conventional type systems, these constraints… CONTINUE READING
4 Extracted Citations
17 Extracted References
Similar Papers

Referenced Papers

Publications referenced by this paper.
Showing 1-10 of 17 references

Dependently typed grammars (2010) Agda code, available from

  • K. Brink, S. Holdermans, A. Löh
  • 2010
1 Excerpt

Structurally recursive descent parsing

  • N. A. Danielsson, U. Norell
  • Draft, available from…
  • 2008
1 Excerpt

Towards a practical programming language based on dependent type theory

  • U. Norell
  • PhD thesis, Chalmers University of Technology
  • 2007
1 Excerpt

Similar Papers

Loading similar papers…