Automatic binding time analysis for a typed \(\lambda\)-calculus (Q1107512)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Automatic binding time analysis for a typed \(\lambda\)-calculus |
scientific article |
Statements
Automatic binding time analysis for a typed \(\lambda\)-calculus (English)
0 references
1988
0 references
The paper presents an algorithm for binding time analysis of a typed lambda-calculus with products, sums, lists, and general recursive types. Two-level lambda-calculus is introduced in order to handle the differences between binding times which come from the distinction between compile-time and run-time bindings. The results can be applied in the implementation of functional languages and of the languages defined by denotational definitions.
0 references
static analysis
0 references
implementations
0 references
denotational semantics
0 references
algorithm
0 references
binding time analysis
0 references
typed lambda-calculus
0 references
functional languages
0 references
