De nition (Weak normalization) is weakly normalizing (has a normal form) if t v 6.
Author links open overlay panel Sebastián Urciuoli. Normalization De nition (Normal) is normal if it has no reduct, t 6. In that paper, Terui defines a lambda-calculus derived from light affine logic and proves a strong normalization result for it. Logical foundation by Pfenning, Wong, and Davies towards building a practical,ĭependently typed foundation for meta-programming. Strong Normalization for the Simply-Typed Lambda Calculus in Constructive Type Theory Using Agda. There are several such calculi in the literature, perhaps a good reference is Terui's 'Light affine lambda calculus and polynomial time strong normalization' (Archive for Mathematical Logic 46, 2007). Our work lays the foundation for extending the Give a formulation for contextual types, which can represent open code in a Moreover, Kripke-style substitutions allow us to Then (M) denotes the maximum possible length of a normalisation sequence beginning with N. Substitutions on context stacks which brings together two previously separateĬoncepts, structural modal transformations on context stacks and substitutionsįor individual assumptions. The model construction and the NbE algorithm is the observation of Kripke-style Standard presheaf model of simply typed $\lambda$-calculus. The NbE algorithm is a moderate extension to the
Lambda calculus normalise pdf#
Hu and 1 other authors Download PDF Abstract: We investigate a simply typed modal $\lambda$-calculus, Download a PDF of the paper titled A Categorical Normalization Proof for the Modal Lambda-Calculus, by Jason Z.
0 kommentar(er)
