A generalised editor calculus (Short Paper)
This work provides a foundational tool for programming language researchers and developers to build error-free editors, but it is incremental as it builds upon existing editor calculus concepts.
The authors tackled the problem of creating syntax-directed editors for any language by generalizing an editor calculus that ensures syntactical correctness and supports incomplete programs, and they encoded this calculus into an extended simply typed lambda calculus.
In this paper, we present a generalization of a syntax-directed editor calculus, which can be used to instantiate a specialized syntax-directed editor for any language, given by some abstract syntax. The editor calculus guarantees the absence of syntactical errors while allowing incomplete programs. The generalized editor calculus is then encoded into a simply typed lambda calculus, extended with pairs, booleans, pattern matching and fixed points