Extensible type-directed editing

Korkut, Joomy; Christiansen, David Thrane

doi:10.1145/3240719.3241791

Cited by 2 publications

(3 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This could, in turn, serve as the basis for a computational hole refinement system that supports efficient live programming, extending the capabilities of purely static hole refinement systems like those available in many languages, e.g. the editor-integrated system of Idris [Brady Live Functional Programming with Typed Holes 1:25 2013; Korkut and Christiansen 2018] and the hole refinement system of Beluga [Pientka 2010;Pientka and Cave 2015]. Each applied hole filling can be interpreted as inducing a new dynamic edit stage.…”

Section: Related and Future Workmentioning

confidence: 99%

Live functional programming with typed holes

Omar

Voysey

Chugh

et al. 2019

Proc. ACM Program. Lang.

View full text Add to dashboard Cite

Live programming environments aim to provide programmers (and sometimes audiences) with continuous feedback about a program's dynamic behavior as it is being edited. The problem is that programming languages typically assign dynamic meaning only to programs that are complete, i.e. syntactically well-formed and free of type errors. Consequently, live feedback presented to the programmer exhibits temporal or perceptive gaps. This paper confronts this "gap problem" from type-theoretic first principles by developing a dynamic semantics for incomplete functional programs, starting from the static semantics for incomplete functional programs developed in recent work on Hazelnut. We model incomplete functional programs as expressions with holes, with empty holes standing for missing expressions or types, and non-empty holes operating as membranes around static and dynamic type inconsistencies. Rather than aborting when evaluation encounters any of these holes as in some existing systems, evaluation proceeds around holes, tracking the closure around each hole instance as it flows through the remainder of the program. Editor services can use the information in these hole closures to help the programmer develop and confirm their mental model of the behavior of the complete portions of the program as they decide how to fill the remaining holes. Hole closures also enable a fill-and-resume operation that avoids the need to restart evaluation after edits that amount to hole filling. Formally, the semantics borrows machinery from both gradual type theory (which supplies the basis for handling unfilled type holes) and contextual modal type theory (which supplies a logical basis for hole closures), combining these and developing additional machinery necessary to continue evaluation past holes while maintaining type safety. We have mechanized the metatheory of the core calculus, called Hazelnut Live, using the Agda proof assistant.We have also implemented these ideas into the Hazel programming environment. The implementation inserts holes automatically, following the Hazelnut edit action calculus, to guarantee that every editor state has some (possibly incomplete) type. Taken together with this paper's type safety property, the result is a proof-of-concept live programming environment where rich dynamic feedback is truly available without gaps, i.e. for every reachable editor state.

show abstract

Section: Related and Future Workmentioning

confidence: 99%

Live functional programming with typed holes

Omar

Voysey

Chugh

et al. 2019

Proc. ACM Program. Lang.

View full text Add to dashboard Cite

show abstract

“…The REPL repeatedly reads in a command and runs it; when it sees quit, it prints the complete proof script and evaluates to the resulting proof term. We conjecture we could also embed ntac with IDEs like emacs or DrRacket, perhaps using the techniques of Korkut and Christiansen [2018], for even better interactivity. Programming with Cur and ntac To demonstrate that one may usefully program with the languages we create, we implemented a large test suite.…”

Section: Companion Dsls For a Proof Assistantmentioning

confidence: 99%

“…The REPL repeatedly reads in a command and runs it; when it sees quit, it prints the complete proof script and evaluates to the resulting term. We conjecture we could also embed with IDEs like emacs or DrRacket, perhaps using the techniques of Korkut and Christiansen [2018], for even better interactivity.…”

Section: Sized Types: Implementing Auxiliary Type Systemsmentioning

confidence: 99%

Dependent type systems as macros

Chang

Ballantyne

Turner

et al. 2019

Proc. ACM Program. Lang.

View full text Add to dashboard Cite

We present Turnstile+, a high-level, macros-based metaDSL for building dependently typed languages. With it, programmers may rapidly prototype and iterate on the design of new dependently typed features and extensions. Or they may create entirely new DSLs whose dependent type łpowerž is tailored to a specific domain. Our framework's support of language-oriented programming also makes it suitable for experimenting with systems of interacting components, e.g., a proof assistant and its companion DSLs. This paper explains the implementation details of Turnstile+, as well as how it may be used to create a wide-variety of dependently typed languages, from a lightweight one with indexed types, to a full spectrum proof assistant, complete with a tactic system and extensions for features like sized types and SMT interaction. CCS Concepts: • Software and its engineering → Specialized application languages.

show abstract

Extensible type-directed editing

Cited by 2 publications

References 19 publications

Live functional programming with typed holes

Live functional programming with typed holes

Dependent type systems as macros

Contact Info

Product

Resources

About