Using a dependently typed host language, we give a well
scoped-and-typed by construction presentation of a minimal
two level simply typed calculus with a static and a dynamic
stage.
The staging function partially evaluating the parts of a term
that are static is obtained by a model construction inspired
by normalisation by evaluation.
We then go on to demonstrate how this minimal language can be
extended to provide additional metaprogramming capabilities,
and to define a higher order functional language evaluating
to digital circuit descriptions.
Tue 16 JanDisplayed time zone: London change
Tue 16 Jan
Displayed time zone: London change
14:00 - 15:30 | |||
14:00 25mTalk | An Intrinsically Typed Compiler for Algebraic Effect Handlers PEPM Syouki Tsuyama Tokyo Institute of Technology, Youyou Cong Tokyo Institute of Technology, Hidehiko Masuhara Tokyo Institute of Technology DOI | ||
14:25 25mTalk | Ownership Types for Verification of Programs with Pointer Arithmetic PEPM Izumi Tanaka University of Tokyo, Ken Sakayori University of Tokyo, Naoki Kobayashi University of Tokyo DOI | ||
14:50 25mTalk | Scoped and Typed Staging by EvaluationRemote PEPM Guillaume Allais University of Strathclyde DOI Pre-print | ||
15:15 15mTalk | One-Pass CPS Translation of Dependent Types (Talk Proposal) PEPM Youyou Cong Tokyo Institute of Technology Pre-print |