Binding-time analysis for both static and dynamic expressions

DOI10.1007/BF03037258zbMath0994.68035MaRDI QIDQ5957057

Kenichi Asai

Publication date: 28 February 2002

Published in: New Generation Computing (Search for Journal in Brave)

zbMATH Keywords

binding-time analyzerconstraint solving algorithm

Mathematics Subject Classification ID

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

Related Items (2)

Finally tagless, partially evaluated: Tagless staged interpreters for simpler typed languages ⋮ From Reduction-Based to Reduction-Free Normalization

Cites Work

• Automatic autoprojection of recursive equations with global variables and abstract data types
• Partial evaluation of computation process -- an approach to a compiler-compiler
• Unnamed Item
• Unnamed Item

This page was built for publication: Binding-time analysis for both static and dynamic expressions