Firstand Second-Order Lambda Calculi with Recursive Types

Authors:
N. P. Mendler
Affiliations:
-
Venue:
Firstand Second-Order Lambda Calculi with Recursive Types
Year:
1986

Citing 0
Cited 1

Inductive-data-type systems

Theoretical Computer Science - Special issue on theories of types and proofs

Quantified Score

Hi-index	0.00

Visualization

Abstract

Recursive types are added to the firstand second-order lambda calculi and the resulting typed terms are shown to be strongly normalizable. A necessary and sufficient condition for strong normalizability is given for unrestricted definitions of recursive types.