6533b821fe1ef96bd127b6b0
RESEARCH PRODUCT
Generating incremental type services
André PacakSebastian Erdwegsubject
050101 languages & linguisticsLocal typeProgramming languageComputer science05 social sciencesName bindingInference02 engineering and technologyType (model theory)Translation (geometry)computer.software_genreDatalog0202 electrical engineering electronic engineering information engineering020201 artificial intelligence & image processing0501 psychology and cognitive sciencescomputercomputer.programming_languagedescription
In this vision paper, we propose a method for generating fully functional incremental type services from declarations of type rules. Our general strategy is to translate type rules into Datalog, for which efficient incremental solvers are already available. However, many aspects of type rules don't naturally translate to Datalog and need non-trivial translation. We demonstrate that such translation may be feasible by outlining the translation rules needed for a language with typing contexts (name binding) and bidirectional type rules (local type inference). We envision that even rich type systems of DSLs can be incrementalized by translation to Datalog in the future.
| year | journal | country | edition | language |
|---|---|---|---|---|
| 2019-10-20 | Proceedings of the 12th ACM SIGPLAN International Conference on Software Language Engineering |