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)
Related documents from co-citation: More All
2: Similix: A self-applicable partial evaluator for Scheme (context) - Jrgensen - 1998
2: A notion of classical pure type system - Barthe, Hatcliff et al. - 1997
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
96 A survey of the project Automath (context) - de Bruijn
87 Notions of computation and monads - Moggi - 1991
83 volume 7 of Cambridge Tracts in Theoretical Computer Science (context) - Girard, Lafont et al. - 1989
76 a better support of static data flow - Consel, Danvy - 1991
69 Curry: Essays on Combinatory Logic (context) - Seldin, Hindley et al. - 1980
68 Logics and Type Systems - Geuvers - 1993
67 Representing monads - Filinski - 1994
67 A direct algorithm for type inference in the rank-2 fragment.. - Kfoury, Wells - 1994
66 Continuation semantics in typed lambdacalculi - Meyer, Wand - 1985
59 An analysis of ML-typability (context) - Kfoury, Tiuryn et al. - 1994
56 Explicit polymorphism and CPS conversion - Harper, Lillibridge - 1993
45 Strong normalization for a typed lambda calculus with lambda.. (context) - Nederpelt - 1973
43 candidats de reductibilit'e (context) - Gallier - 1990
42 A realizability interpretation of the theory of species (context) - Tait - 1975
35 new notions of reduction and non-semantic proofs of fi-stron.. (context) - Kfoury, Wells - 1995
35 The Barendregt cube with definitions and generalised reducti.. - Bloo, Kammareddine et al. - 1996
28 Proofs of strong normalization (context) - Gandy
27 Type reconstruction in finite-rank fragments of the second-o.. (context) - Kfoury, Tiuryn - 1992
26 Strict functionals for termination proofs (context) - Pol, Schwichtenberg - 1995
25 The longest perpetual reductions in orthogonal expression re.. - Khasidashvili - 1994
24 Domain-free pure type systems - Barthe, Sorensen - 1994
24 LISP and Symbolic Computation (context) - Reynolds, of - 1993
23 A reflection on call-by-value - Sabry - 1996
22 The conservation theorem revisited - de Groote
22 Une 'equivalence sur les lambda-termes (context) - Regnier - 1994
20 translation and looping combinators in pure type systems - Coquand, Herbelin - 1994
20 An early proof of normalization by (context) - Gandy
19 Strong normalization and perpetual reductions in the lambda .. (context) - Bergstra, Klop - 1982
19 Termination proofs for higher-order rewrite systems - Pol - 1994
17 Surjective Pairing and Strong Normalization: Two Themes in L.. (context) - de Vrijer - 1987
14 Perpetuality and strong normalization in orthogonal term rew.. - Khasidashvili - 1994
14 Syntactic translations and provably recursive functions (context) - Leivant - 1985
11 A direct proof of the finite developments theorem (context) - de Vrijer - 1985
10 An induction measure on -terms and its applications (context) - Xi - 1996
10 Delayability (context) - Karr - 1985
10 Form Reduction Systems and Reductions of Contracted Forms an.. (context) - Khasidashvili - 1988
9 volume 664 of Lecture Notes in Computer Science (context) - Bezem, Groote et al. - 1993
9 An upper bound for reduction sequences in the typed lambda-c.. (context) - Schwichtenberg - 1991
9 evaluation styles and types systems (context) - Werner - 1992
8 Complexity of normalization in the pure typed lambda-calculu.. (context) - Schwichtenberg - 1982
8 Ordinal analysis of terms of finite type (context) - Howard - 1980
7 Nouvelles Notions de R'eduction en Lambda Calcul (context) - Vidal - 1989
6 Normalisation by translation (context) - Loader - 1995
6 Department of Mathematical Sciences (context) - Xi, strong et al. - 1996
6 Properties of infinite reduction paths in untyped - calculus (context) - Sorensen - 1996
5 Technical Report CS-R (context) - van Raamsdonk, Severi - 1995
5 Effective longest and infinite reduction paths in untyped -c.. (context) - Sorensen - 1996
4 Lower and upper bounds for reductions of types (context) - Springintveld
4 Ellis Horwood Series in Computers and their Applications (context) - Krivine, Types - 1993
4 Types and Computations in Lambda Calculi and Graph Rewrite S.. (context) - Barendsen - 1995
3 Technical Report Preprint (context) - Barendregt, Bergstra et al. - 1976
2 Positive recursive type assigment (context) - Urzyczyn - 1995
1 A reduction relation for which postponement of k-contraction.. (context) - Kammareddine - 1996
1 Generalized fi-reduction and explicit substitution (context) - Kammareddine, R'ios - 1996
1 Special issue in honour of Corrado Bohm (context) - Klop, van Oostrom et al. - 1993
1 A unified approach to type theory through a refined -calculu.. (context) - Kammareddine, Nederpelt - 1994
1 Two different strong normalization proofs (context) - Pol - 1996
1 Theoretical Computer Science (context) - Kammareddine, Nederpelt et al. - 1996
1 Type inference and simplle subtypes (context) - Mitchell - 1991
1 Refining reduction in the lambda calculus (context) - Kammareddine, Nederpelt - 1995
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