Automatic binding time analysis for a typed \(\lambda\)-calculus (Q1107512): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (5 intermediate revisions by 4 users not shown) | |||
| Property / reviewed by | |||
| Property / reviewed by: Jiří Zlatuška / rank | |||
| Property / reviewed by | |||
| Property / reviewed by: Jiří Zlatuška / rank | |||
Normal rank | |||
| Property / describes a project that uses | |||
| Property / describes a project that uses: Miranda / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0167-6423(88)90025-1 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2169611723 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 21:20, 19 March 2024
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
