A linearization of the Lambda-calculus and consequences
From MaRDI portal
Publication:4500177
DOI10.1093/logcom/10.3.411zbMath0953.03014MaRDI QIDQ4500177
Publication date: 4 September 2000
Published in: Journal of Logic and Computation (Search for Journal in Brave)
Full work available at URL: https://hdl.handle.net/2144/1597
weak normalization; \(\lambda\)-calculus; intersection types; strong normalization; type inference; generalization of beta reduction
Related Items
Unnamed Item, Execution time of λ-terms via denotational semantics and intersection types, Unnamed Item, Unnamed Item, Unnamed Item, Tight typings and split bounds, fully developed, Infinitary affine proofs, Essential and relational models, Unnamed Item, Non-Deterministic Functions as Non-Deterministic Processes (Extended Version), Structural rules and algebraic properties of intersection types, Quantitative weak linearisation, Node Replication: Theory And Practice, A type assignment for \(\lambda\)-calculus complete both for FPTIME and strong normalization, Intuitionistic differential nets and lambda-calculus, Differential interaction nets, Uniformity and the Taylor expansion of ordinary lambda-terms, The spirit of node replication, Weak linearization of the lambda calculus, Reasoning About Call-by-need by Means of Types, Parsimonious Types and Non-uniform Computation
