Automatic binding time analysis for a typed \(\lambda\)-calculus
From MaRDI portal
Publication:1107512
DOI10.1016/0167-6423(88)90025-1zbMath0653.03008OpenAlexW2169611723MaRDI QIDQ1107512
Hanne R. Nielson, Flemming Nielson
Publication date: 1988
Published in: Science of Computer Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0167-6423(88)90025-1
algorithmfunctional languagesstatic analysisdenotational semanticstyped lambda-calculusimplementationsbinding time analysis
Specification and verification (program logics, model checking, etc.) (68Q60) Abstract data types; algebraic specification (68Q65) Combinatory logic and lambda calculus (03B40)
Related Items (7)
A partial evaluator for a parallel lambda language ⋮ Comparing flow-based binding-time analyses ⋮ Two-level semantics and abstract interpretation ⋮ On-line and off-line partial evaluation: semantic specifications and correctness proofs ⋮ Using transformations in the implementation of higher-order functions ⋮ Functional completeness of the mixed \(\lambda\)-calculus and combinatory logic ⋮ Enhanced type inference for binding-time analysis
Uses Software
This page was built for publication: Automatic binding time analysis for a typed \(\lambda\)-calculus
