A modal analysis of staged computation

@article{Davies2001AMA,
  title={A modal analysis of staged computation},
  author={Rowan Davies and Frank Pfenning},
  journal={J. ACM},
  year={2001},
  volume={48},
  pages={555-604}
}
We show that a type system based on the intuitionistic modal logic S4 provides an expressive framework for specifying and analyzing computation stages in the context of typed λ-calculi and functional languages. We directly demonstrate the sense in which our <inline-equation> <f> <g>l</g><sup>→□</sup><inf>e</inf></f> </inline-equation>-calculus captures staging, and also give a conservative embeddng of Nielson and Nielson's two-level functional language in our functional language Mini-ML<inline… 
A Dependently Typed Multi-Stage Calculus
TLDR
Motivated by code generators that generate code whose type depends on a value from outside of the quotations, the significance of cross-stage persistence in dependently typed multi-stage programming and certain type equivalences that are not directly derived from reduction rules are argued.
Polymorphic Context for Contextual Modality
TLDR
It is claimed that polymorphic context allows both binding manipulation and hygienic code generation and is generalized to accommodate not only S4 but also K, T, and K4 modalities, and proven to enjoy many desired properties.
Categorical and algebraic aspects of the intuitionistic modal logic IEL - and its predicate extensions
TLDR
The modal lambda calculus is constructed, which is Curry–Howard isomorphic to $\textbf{IEL}^{-}$ as the type-theoretical representation of applicative computation widely known in functional programming.
A Temporal Logic Approach to Binding-Time Analysis
TLDR
It is demonstrated that there is a fundamental relationship between temporal logic and languages that involve multiple stages, such as those used to analyze binding times in the context of partial evaluation, and λ° is equivalent to the core of a previously studied multilevel binding-time analysis.
Dual-context Modal Logic as Left Adjoint of Fitch-style Modal Logic
TLDR
This paper observes an interesting fact that the box modality of the dualcontext system is in fact a left adjoint of that of the Fitch-style system, and embeds both the two systems into the adjoint calculus that equips an adjunction a priori.
Intensional computation with higher-order functions
  • B. Jay
  • Computer Science
    Theor. Comput. Sci.
  • 2019
Proceedings of the Workshop on Intuitionistic Modal Logic and Applications (IMLA'08)
TLDR
A version of constructive linear-time temporal logic with the “next” temporal operator with natural deduction and Kripke semantics for constructive LTL with conjunction and disjunction, and proves soundness and completeness.
Semantical study of intuitionistic modal logics
TLDR
The following observation arises: there are actually two possible meanings of the assertion “a formula A is true at a possible world x,” which explains the difference between the traditional modal logic and IMLs considered in this thesis, and several difficulties that emerge in establishing meta-theoretical results such as completeness and cut-elimination.
A modal calculus for named control e-ects
TLDR
A type system that internalizes the notion of exceptional computations, but avoids the above two properties is proposed, and the necessitation operator from a version of constructive modal logic is used.
Contextual modal types for algebraic effects and handlers
TLDR
This paper views the algebraic effect theory of a computation as a variable context, and track the effects directly in computation’s modal type with ECMTT, a novel calculus for algebraic effects and handlers, which is the first system to relategebraic effects to modal types.