B. Guillaume. The s e -calculus Does Not Preserve Strong Normalization. Journal of Functional Programming, 10(4):321-325, 2000. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Electronic Notes in Theoretical Computer Science 67 (2002) - Url Http Www (Correct)
....not pro t from the existence of the built in arithmetic for indices. These observations may be relevant for the treatment of the open question of preservation of strong normalization of susp (conjectured positively in [26] since the s e has been proved to answer this question negatively in [16]. 6 Future Work and Conclusion [13,2] showed that reduction is of great interest for adapting substitution calculi ( and s e ) for important practical problems like higher order uni cation. In this paper we have enlarged the suspension calculus of [28,26] with an adequate Eta rule for ....
....programming environments. An immediate work to be done is to study two open questions: 1) whether the s e calculus has strong normalization (SN) 2) whether susp preserves SN. Interesting points arise in this context since: a) s e is more adequate than susp , b) s e does not preserves SN [16] and c) the substitution calculus of susp has SN. ....
B. Guillaume. The s e -calculus Does Not Preserve Strong Normalization. Journal of Functional Programming, 10(4):321-325, 2000.
Electronic Notes in Theoretical Computer Science 67 (2002) - Url Http Www (Correct)
....not pro t from the existence of the built in arithmetic for indices. These observations may be relevant for the treatment of the open question of preservation of strong normalization of susp (conjectured positively in [26] since the s e has been proved to answer this question negatively in [16]. 6 Future Work and Conclusion [13,2] showed that reduction is of great interest for adapting substitution calculi ( and s e ) for important practical problems like higher order uni cation. In this paper we have enlarged the suspension calculus of [28,26] with an adequate Eta rule for ....
....programming environments. An immediate work to be done is to study two open questions: 1) whether the s e calculus has strong normalization (SN) 2) whether susp preserves SN. Interesting points arise in this context since: a) s e is more adequate than susp , b) s e does not preserves SN [16] and c) the substitution calculus of susp has SN. ....
B. Guillaume. The s e -calculus Does Not Preserve Strong Normalization. Journal of Functional Programming, 10(4):321-325, 2000.
Explicit Substitutions and All That - Ayala-Rincón, Muñoz (2000) (Correct)
....the updating operator, is introduced to make the appropriate lift over N (rule ( destruction) Otherwise either free de Bruijn indices are decremented by one or bounded maintained. The s e calculus simulates reduction and is con uent [33] It does not preserve strong normalization [28]. 3.4 Simply typed calculi of explicit substitutions In this section, we only include the essential notation of the simply typed L and s e calculi. Properties can be found in detail in [44] and [32] respectively. Typing rules in both calculi follow the scheme as those of the simply typed ....
B. Guillaume. The s e -calculus Does Not Preserve Strong Normalization. Journal of Functional Programming, 1999. To appear.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC