Morten Heine Sørensen  Home/Search
Context Related
| diku.dk/diku/semantics/pa...D339.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: diku.dk/researchgroups/to...1997 (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: For some typed -calculi it is easier to prove weak normalization than strong normalization. Techniques to infer the latter from the former have been invented over the last twenty years by Nederpelt, Klop, Khasidashvili, Karr, de Groote, and Kfoury and Wells. However, these techniques infer strong normalization of one notion of reduction from weak normalization of a more complicated notion of reduction. This paper presents a new technique to infer strong normalization of a notion of reduction in ... (Update)
Similar documents based on text: More All
1.1: Weak Normalization Implies Strong Normalization in.. - Barthe, Hatcliff.. (1997) (Correct)
0.3: Normalization for Simultaneous Free Algebras - Benl, Berger, Schwichtenberg (2000) (Correct)
0.2: Conservation and Uniform Normalization in Lambda Calculi.. - Neergaard, Sørensen (2002) (Correct)
BibTeX entry: (Update)
Morten Heine Srensen. Strong normalization from weak normalization in typed #-calculi. Information and Computation, 133(1):35--71, February 1997. Cited on pages 2, 3, 77, 84, 92, 103, 104, and 111. http://citeseer.ist.psu.edu/srensen97strong.html More
@misc{ srensen97strong,
author = "M. Srensen",
title = "Strong normalization from weak normalization in typed #-calculi",
text = "Morten Heine Srensen. Strong normalization from weak normalization in typed
#-calculi. Information and Computation, 133(1):35--71, February 1997. Cited
on pages 2, 3, 77, 84, 92, 103, 104, and 111.",
year = "1997",
url = "citeseer.ist.psu.edu/srensen97strong.html" }
Citations (may not include all citations):729 The Lambda Calculus: Its Syntax and Semantics (context) - Barendregt - 1984
382 Lambda calculi with types - Barendregt - 1992
291 Computational lambda-calculus and monads - Moggi - 1989
283 Theoretical Computer Science (context) - Plotkin, call-by-value et al. - 1975
259 Combinatory Logic (context) - Curry, Feys - 1958
233 The formulae-as-types notion of construction (context) - Howard
174 Combinatory Reduction Systems (context) - Klop - 1980
169 A call-by-need lambda-calculus - Ariola, Felleisen et al. - 1995
167 Natural Deduction: A proof theoretical study (context) - Prawitz - 1965
158 Reasoning about programs in continuationpassing style - Sabry, Felleisen - 1993
137 Introduction to Combinators and - calculus (context) - Hindley, Seldin - 1986
132 Interpr'etation fonctionelle et 'elimination des coupures da.. (context) - Girard - 1972
121 Intensional interpretations of functionals of finite type (context) - Tait - 1967
110 A formulae-as-types notion of control - Griffin - 1990
104 Metamathematical Investigation of Intuitionistic Arithmetic .. (context) - Troelstra - 1973
[Article contains additional citations not shown here]
Documents on the same site (http://www.diku.dk/research-groups/topps/bibliography/1997.html): More
A kappa-denotational semantics for Map Theory in ZFC + SI - Berline, Grue (1996) (Correct)
Constraints to Stop Higher-Order Deforestation - Seidl, Sørensen (1997) (Correct)
CPS Translations and Applications: The Cube and Beyond - Barthe, Hatcliff, Sørensen (1996) (Correct)
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