The impact of teachers' beliefs on grammar instruction and students' grammar competences Ghent University
Finally tagless observable recursion for an grammar model Vrije Universiteit Brussel KU Leuven
We define a finally tagless, shallow embedding of a typed grammar language. In order to avoid the limitations of traditional parser combinator libraries (no bottom-up parsing, no full grammar analysis or transformation), we require object-language recursion to be observable in the meta-language. Since existing proposals for recursive constructs are not fully satisfactory, we propose new finally tagless primitive recursive constructs to solve ...