Open AccessBinding Time Analysis: Abstract Interpretation vs. Type Inference
Author(s) -
Jens Palsberg,
Michael I. Schwartzbach
Publication year - 1992
Publication title -
daimi pb
Language(s) - English
Resource type - Journals
eISSN - 2245-9316
pISSN - 0105-8517
DOI - 10.7146/dpb.v21i393.6628
Subject(s) - interpretation (philosophy) , inference , type inference , computer science , type (biology) , abstract interpretation , task (project management) , lambda calculus , natural language processing , algorithm , artificial intelligence , calculus (dental) , programming language , medicine , management , dentistry , economics , ecology , biology
Binding time analysis is important in partial evaluators. Its task is to determine which parts of a program can be specialized if some of the expected input is known. Two approaches to do this are abstract interpretation and type inference. We compare two specific such analyses to see which one determines most program parts to be eliminable. The first is the abstract interpretation approach of Bondorf, and the second is the type inference approach o£ Gomard. Both apply to the untyped lambda calculus. We prove that Bondorf's analysis is better than Gomard's.