Please use this identifier to cite or link to this item:
https://open.uns.ac.rs/handle/123456789/11432
Title: | Characterizing strong normalization in a language with control operators | Authors: | Dougherty D. Gilezan, Silvia Lescanne P. |
Issue Date: | 1-Jan-2004 | Journal: | Proceedings of the Sixth ACM SIGPLAN Conference on Principles and Practice of Declarative Programming, PPDP'04 | Abstract: | We investigate some fundamental properties of the reduction relation in the untyped term alculus derived from Curien and Herbelin's λμμ The original λμμ has a system of simple types, based on sequent calculus, embodying a Curry-Howard correspondence with classical logic; the significance of the untyped calculus of raw terms is that it is a Turing-complete language for computation with explicit representation of control as well as code. We define a type assignment system for the raw terms satisfying: a term is typable if and only if it is strongly normalizing. The intrinsic symmetry in the λμμ calculus leads to an essential use of both intersection and union types; in contrast to other union-types systems in the literature, our system enjoys the Subject Reduction property. | URI: | https://open.uns.ac.rs/handle/123456789/11432 | ISBN: | 1581138199 |
Appears in Collections: | FTN Publikacije/Publications |
Show full item record
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.