Binding-time analysis for both static and dynamic expressions
From MaRDI portal
(Redirected from Publication:5957057)
Recommendations
Cites work
- Automatic autoprojection of recursive equations with global variables and abstract data types
- scientific article; zbMATH DE number 3936534 (Why is no real title available?)
- scientific article; zbMATH DE number 236855 (Why is no real title available?)
- Partial evaluation of computation process -- an approach to a compiler-compiler
Cited in
(11)- Static semantics, types, and binding time analysis
- Accurate binding-time analysis for imperative languages: Flow, context, and return sensitivity
- Enhanced type inference for binding-time analysis
- Binding-Time Annotations without Binding-Time Analysis
- Finally tagless, partially evaluated: Tagless staged interpreters for simpler typed languages
- From reduction-based to reduction-free normalization
- scientific article; zbMATH DE number 1231585 (Why is no real title available?)
- scientific article; zbMATH DE number 1508929 (Why is no real title available?)
- scientific article; zbMATH DE number 1738290 (Why is no real title available?)
- Tools and Algorithms for the Construction and Analysis of Systems
- Logic Based Program Synthesis and Transformation
This page was built for publication: Binding-time analysis for both static and dynamic expressions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5957057)