Automatic binding time analysis for a typed \(\lambda\)-calculus (Q1107512)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4064956
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Automatic binding time analysis for a typed \(\lambda\)-calculus |
scientific article; zbMATH DE number 4064956 |
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
0.7915106415748596
0 references
0.7901224493980408
0 references
0.771848738193512
0 references
0.7636044025421143
0 references
