Work

On normalisation

Year: 1995

Type: other

Abstract: 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.

Source: Data Archiving and Networked Services (DANS)

Authors: Femke van Raamsdonk, Paula Severi

Language: French

Topic: Logic, programming, and type systems

Subfield: Software

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

Funders: European Research Consortium for Informatics and Mathematics, Vrije Universiteit Amsterdam, Nederlandse Organisatie voor Wetenschappelijk Onderzoek, Centrum Wiskunde and Informatica

OpenAlex ID: W2911937136

Cites:

Cited by: 19

Related to: 10