A generalised editor calculus (Short Paper)
Fuente:
arXiv
Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866913857660780544 |
|---|---|
| author | Bennetzen, Benjamin Steffensen, Peter Buus Hüttel, Hans Kristensen, Nikolaj Rossander Mortensen, Andreas Tor |
| author_facet | Bennetzen, Benjamin Steffensen, Peter Buus Hüttel, Hans Kristensen, Nikolaj Rossander Mortensen, Andreas Tor |
| contents | 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 |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2505_18778 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | A generalised editor calculus (Short Paper) Bennetzen, Benjamin Steffensen, Peter Buus Hüttel, Hans Kristensen, Nikolaj Rossander Mortensen, Andreas Tor Computation and Language F.2.2, I.2.7 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 |
| title | A generalised editor calculus (Short Paper) |
| topic | Computation and Language F.2.2, I.2.7 |
| url | https://arxiv.org/abs/2505.18778 |