Enhanced type inference for binding-time analysis

DOI10.2478/AUSI-2020-0014MaRDI QIDQ2061291zbMATH OpenOpenAlexFDO

Authors Mátyás Szokoli, A. Kiss

Publication date 13 December 2021

Published in Acta Universitatis Sapientiae. Informatica (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

Full work available at URL https://doi.org/10.2478/ausi-2020-0014

zbMATH Keywords

binding-time analysisdynamic typingfunctional languagespartial evaluationtype inference

Mathematics Subject Classification ID

Theory of programming languages (68N15) Functional programming and lambda calculus (68N18)

Recommendations

• scientific article; zbMATH DE number 2084340
• Static semantics, types, and binding time analysis
• Improving precision of type analysis using non-discriminative union
• Binding-time analysis for both static and dynamic expressions
• Type inference, abstract interpretation and strictness analysis
• Tools and Algorithms for the Construction and Analysis of Systems
• Inferring effective types for static analysis of C programs
• scientific article; zbMATH DE number 1693038

Cites work

• A partial evaluator for the untyped lambda-calculus
• Automatic binding time analysis for a typed -calculus
• scientific article; zbMATH DE number 2238212 (Why is no real title available?)
• Logic Based Program Synthesis and Transformation
• Typability and type checking in System F are equivalent and undecidable
• Types and programing languages

Cited in

(5)

• Automatic binding time analysis for a typed -calculus
• Static semantics, types, and binding time analysis
• Accurate binding-time analysis for imperative languages: Flow, context, and return sensitivity
• Binding-Time Annotations without Binding-Time Analysis
• Guided Type Debugging

This page was built for publication: Enhanced type inference for binding-time analysis

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2061291)