Building DSLs on Top of KernelF
summary
KernelF provides a small functional core for building DSLs with a built-in interpreter that runs programs in the IDE, a test language with coverage and a REPL, and experimental mutation and test-case generators. It ships modularly (about 15 pickable language pieces), supports temporal types and physical units, and exposes a Java-based runtime and an interpreter-DSL for concise semantics (the traffic-light state machine interpreter fits in ~20 Java-ish lines). Customers use it for healthcare dosing, salary and tax rules, tables and grammar-cell editors, and it is embeddable and constrainable inside MPS.
AI-written summary · about
chapters (8)
- 0:00Introduction
- 3:08What is KernelF
- 8:22KernelF features
- 12:38DSLs with KernelF
- 18:40How to use KernelF for DSL development
- 25:38Extending KernelF with state machines
- 40:44Embedder platform features
- 49:16Q&A
related talks
24mDesigning a DSL That Perfectly Solves Your Problem
35mDesigning Domain-Specific Languages: A Comparison of Three Approaches by Example
53mDeveloping DSLs in a pragmatic way
22mDesign DSLs with xDSL
23mAnyDSL: A Partial Evaluation Framework for Programming High-Performance Libraries
01h 01mChallenges in the Design and Implementation of Teaching Languages for EDSLs
22mDSLs in Racket: You Want It How, Now?
29mIntegrating Language Engineering into the Software Development Process