1995
On normalisation
Publication
Publication
Using a characterisation of strongly normalising $lambda$-terms, we give new and simple proofs of the following: all developments and superdevelopments are finite, a certain rewrite strategy is perpetual, a certain rewrite strategy is maximal and thus perpetual, simply typed $lambda$-calculus is strongly normalising.
Additional Metadata | |
---|---|
, | |
, | |
CWI | |
Department of Computer Science [CS] | |
van Raamsdonk, F., & Severi, P. (1995). On normalisation. Department of Computer Science [CS]. CWI. |