2025/05/24 by Benjamin Bennetzen, Peter Buus Steffensen, Bennetzen, Benjamin +6
Computer Science · Mathematics · #Advanced Topics in Algebra #Computation and Language (cs.CL) #F.2.2 #FOS: Computer and information sciences #I.2.7 #Logic, programming, and type systems #Polynomial and algebraic computation
paper · pdf · doi:10.48550/arxiv.2505.18778
openalex publication_date 2025/05/24 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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