Enhanced type inference for binding-time analysis

DOI10.2478/ausi-2020-0014OpenAlexW3134480071MaRDI QIDQ2061291

A. Kis, Mátyás Szokoli

Publication date: 13 December 2021

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

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

zbMATH Keywords

functional languagespartial evaluationtype inferencedynamic typingbinding-time analysis

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Automatic binding time analysis for a typed \(\lambda\)-calculus
• Typability and type checking in System F are equivalent and undecidable
• A partial evaluator for the untyped lambda-calculus
• Logic Based Program Synthesis and Transformation

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