Cs-R9545 1995 (1995)
| Venue: | Centrum voor Wiskunde en Informatica (CWI |
BibTeX
@TECHREPORT{Issn95cs-r95451995,
author = {Report Cs-R Issn and F. Van Raamsdonk and P. Severi and Issn -x and Femke Van Raamsdonk and Paula Severi},
title = {Cs-R9545 1995},
institution = {Centrum voor Wiskunde en Informatica (CWI},
year = {1995}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Using a characterisation of strongly normalising -terms, we give new and simple proofs of the following: 1. all developments and superdevelopments are finite, 2. a certain rewrite strategy is perpetual, 3. a certain rewrite strategy is maximal and thus perpetual, 4. simply typed -calculus is strongly normalising. AMS Subject Classification (1991): 03B40, 03D70. CR Subject Classification (1991): F.3.3, F.4.1. Keywords & Phrases: -calculus, normalisation, perpetual strategies. Note: The research of the first author is supported by NWO/SION project 612-316-606. This report is also available as Computing Science Report 95/20, Eindhoven University of Technology. 1. Introduction 2 1. Introduction This paper represents an effort to shed some more light on various results concerning normalisation in -calculus. We deal with -calculus with only fi-reduction. As a first step towards a better understanding we characterise both the set of weakly normalising terms and the set of strongly norm...
