On the public citation graph
Mix: A self-applicable partial evaluator for experiments in compiler generation
0 signed · 252 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/spe.4380160104openalex-snapshot
Executable semantic descriptions
inferredcites →https://doi.org/10.1007/3-540-11980-9_13openalex-snapshot
Partial computation of programs
inferredcites →https://doi.org/10.1007/3-540-15976-2_6openalex-snapshot
An experiment in partial evaluation: The generation of a compiler generator
inferredcites →https://doi.org/10.1007/3-540-16446-4_14openalex-snapshot
The structure of a self-applicable partial evaluator
inferredcites →https://doi.org/10.1007/3-540-16446-4_17openalex-snapshot
From interpreter to compiler: A representational derivation
inferredcites →https://doi.org/10.1007/3-540-16492-8_82openalex-snapshot
Compiling OR-parallelism into AND-parallelism
inferredcites →https://doi.org/10.1007/3-540-19027-9_16openalex-snapshot
New insights into partial evaluation: the SCHISM experiment
inferredcites →https://doi.org/10.1007/bf00271642openalex-snapshot
Polyvariant mixed computation for analyzer programs
inferredcites →https://doi.org/10.1007/bf03037133openalex-snapshot
A self-applicable partial evaluator and its use in incremental compilation
inferredcites →https://doi.org/10.1007/bf03037134openalex-snapshot
Mixed computation of Prolog programs
inferredcites →https://doi.org/10.1007/bf03037145openalex-snapshot
Annotated bibliography on partial evaluation and mixed computation
inferredcites →https://doi.org/10.1007/bfb0022492openalex-snapshot
Formal description of programming concepts
inferredcites →https://doi.org/10.1016/0004-3702(76)90011-4openalex-snapshot
A partial evaluator, and its use as a programming tool
inferredcites →https://doi.org/10.1016/0016-0032(66)90057-3openalex-snapshot
Advances in computers, vol. 6
inferredcites →https://doi.org/10.1016/0304-3975(82)90111-6openalex-snapshot
Mixed computation: potential applications and problems for study
inferredcites →https://doi.org/10.1016/0304-3975(86)90173-8openalex-snapshot
Partial evaluation and ω-completeness of algebraic specifications
inferredcites →https://doi.org/10.1093/comjnl/12.1.28openalex-snapshot
Theory of Recursive Functions and Effective Computability
inferredcites →https://doi.org/10.1108/ir.1999.04926fae.001openalex-snapshot
Lecture Notes in Computer Science 1205
inferredcites →https://doi.org/10.1145/321992.321996openalex-snapshot
A Transformation System for Developing Recursive Programs
inferredcites →https://doi.org/10.1145/41625.41651openalex-snapshot
A realistic compiler generator based on high-level semantics: another progress report
inferredcites →https://doi.org/10.1145/43908.43910openalex-snapshot
A bibliography on partial evaluation
inferredcites →https://doi.org/10.1145/512644.512652openalex-snapshot
Compilers and staging transformations
inferredcites →https://doi.org/10.1145/512760.512781openalex-snapshot
A partial evaluator, and its use for compiling iterative statements in LISP
inferredcites →https://doi.org/10.1145/582153.582178openalex-snapshot
A semantics-directed compiler generator
inferredcites →https://doi.org/10.1145/800068.802134openalex-snapshot
Experiments with a supercompiler
inferredcites →https://doi.org/10.1145/800087.802808openalex-snapshot
On compiling embedded languages in LISP
inferredcites →https://doi.org/10.1145/954063.954069openalex-snapshot
A supercompiler system based on the language REFAL
inferredcites →https://doi.org/10.2307/2316720openalex-snapshot
Theory of Recursive Functions and Effective Computability.
inferredcites →https://doi.org/10.4135/9781483346274.n148openalex-snapshot
Human Information Processing
inferredcites →https://doi.org/10.7146/dpb.v10i137.7411openalex-snapshot
Control Flow Treatment in a Simple: Semantics-Directed Compiler Generator
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/spe.1086openalex-snapshot
A self‐applicable online partial evaluator for recursive flowchart languages
inferred← citeshttps://doi.org/10.1002/spe.4380210505openalex-snapshot
A modular fully‐lazy lambda lifter in Haskell
inferred← citeshttps://doi.org/10.1007/11924661_25openalex-snapshot
On Jones-Optimal Specializers: A Case Study Using Unmix
inferred← citeshttps://doi.org/10.1007/3-540-19027-9_16openalex-snapshot
New insights into partial evaluation: the SCHISM experiment
inferred← citeshttps://doi.org/10.1007/3-540-36377-7openalex-snapshot
The essence of computation: complexity, analysis, transformation
inferred← citeshttps://doi.org/10.1007/3-540-36377-7_14openalex-snapshot
A Symmetric Approach to Compilation and Decompilation
inferred← citeshttps://doi.org/10.1007/3-540-36377-7_15openalex-snapshot
The Abstraction and Instantiation of String-Matching Programs
inferred← citeshttps://doi.org/10.1007/3-540-36575-3_23openalex-snapshot
Tagging, Encoding, and Jones Optimality
inferred← citeshttps://doi.org/10.1007/3-540-36579-6_6openalex-snapshot
A New One-Pass Transformation into Monadic Normal Form
inferred← citeshttps://doi.org/10.1007/3-540-46562-6_7openalex-snapshot
Binding-Time Analysis in Partial Evaluation: One Size Does Not Fit All
inferred← citeshttps://doi.org/10.1007/3-540-47018-2_2openalex-snapshot
An Introduction to Online and Offline Partial Evaluation Using a Simple Flowchart Language
inferred← citeshttps://doi.org/10.1007/3-540-50820-1_51openalex-snapshot
Compiling typol with attribute grammars
inferred← citeshttps://doi.org/10.1007/3-540-50940-2_29openalex-snapshot
A self-applicable partial evaluator for term rewriting systems
inferred← citeshttps://doi.org/10.1007/3-540-50940-2_43openalex-snapshot
Binding time analysis for polymorphically typed higher order languages
inferred← citeshttps://doi.org/10.1007/3-540-51237-3_11openalex-snapshot
Experiments with implementations of two theoretical constructions
inferred← citeshttps://doi.org/10.1007/3-540-52592-0_56openalex-snapshot
Automatic autoprojection of higher order recursive equations
inferred← citeshttps://doi.org/10.1007/3-540-52592-0_57openalex-snapshot
From interpreting to compiling binding times
inferred← citeshttps://doi.org/10.1007/3-540-53101-7_11openalex-snapshot
Abstract interpretation using attribute grammars
inferred← citeshttps://doi.org/10.1007/3-540-54317-1_103openalex-snapshot
A simplifier for untyped lambda expressions
inferred← citeshttps://doi.org/10.1007/3-540-54444-5_94openalex-snapshot
Semantics-directed generation of a Prolog compiler
inferred← citeshttps://doi.org/10.1007/3-540-55253-7_9openalex-snapshot
Extraction of strong typing laws from action semantics definitions
inferred← citeshttps://doi.org/10.1007/3-540-55844-6_136openalex-snapshot
Unfold/fold transformations preserving termination properties
inferred← citeshttps://doi.org/10.1007/3-540-56282-6_19openalex-snapshot
Meta-programming for reordering literals in deductive databases
inferred← citeshttps://doi.org/10.1007/3-540-56282-6_4openalex-snapshot
An introduction to partial deduction
inferred← citeshttps://doi.org/10.1007/3-540-56393-8_32openalex-snapshot
Generalized partial computation using disunification to solve constraints
inferred← citeshttps://doi.org/10.1007/3-540-56777-1_10openalex-snapshot
Partial evaluation and symbolic computation for the understanding of Fortran programs
inferred← citeshttps://doi.org/10.1007/3-540-56992-8_23openalex-snapshot
Kleene's slash and existence of values of open terms in type theory
inferred← citeshttps://doi.org/10.1007/3-540-57264-3_34openalex-snapshot
Occam's razor in metacomputation: the notion of a perfect process tree
inferred← citeshttps://doi.org/10.1007/3-540-57880-3_19openalex-snapshot
Polymorphic binding-time analysis
inferred← citeshttps://doi.org/10.1007/3-540-58402-1_15openalex-snapshot
Hand-writing program generator generators
inferred← citeshttps://doi.org/10.1007/3-540-58485-4_57openalex-snapshot
Generating transformers for deforestation and supercompilation
inferred← citeshttps://doi.org/10.1007/3-540-61055-3_39openalex-snapshot
Modular denotational semantics for compiler construction
inferred← citeshttps://doi.org/10.1007/3-540-61580-6_12openalex-snapshot
Efficiently generating efficient generating extensions in prolog
inferred← citeshttps://doi.org/10.1007/3-540-61580-6_18openalex-snapshot
A comparative revisitation of some program transformation techniques
inferred← citeshttps://doi.org/10.1007/3-540-61580-6_24openalex-snapshot
Metacomputation: Metasystem transitions plus supercompilation
inferred← citeshttps://doi.org/10.1007/3-540-61580-6_4openalex-snapshot
A uniform approach for compile-time and run-time specialization
inferred← citeshttps://doi.org/10.1007/3-540-61580-6_8openalex-snapshot
A roadmap to metacomputation by supercompilation
inferred← citeshttps://doi.org/10.1007/3-540-61580-6_9openalex-snapshot
Reasoning about hierarchies of online program specialization systems
inferred← citeshttps://doi.org/10.1007/3-540-61756-6_85openalex-snapshot
Semantics-based compiling: A case study in type-directed partial evaluation
inferred← citeshttps://doi.org/10.1007/3540543961_22openalex-snapshot
Efficient type inference for higher-order binding-time analysis
inferred← citeshttps://doi.org/10.1007/3540543961_24openalex-snapshot
For a better support of static data flow
inferred← citeshttps://doi.org/10.1007/3540543961_9openalex-snapshot
Automatic online partial evaluation
inferred← citeshttps://doi.org/10.1007/978-1-4471-3166-3_16openalex-snapshot
Dependent Sums Express Separation of Binding Times
inferred← citeshttps://doi.org/10.1007/978-1-4471-3166-3_8openalex-snapshot
Sketching a Constructive Definition of ‘mix’
inferred← citeshttps://doi.org/10.1007/978-1-4471-3196-0_13openalex-snapshot
Generating More Practical Compilers by Partial Evaluation
inferred← citeshttps://doi.org/10.1007/978-1-4471-3196-0_14openalex-snapshot
A Loop-Detecting Interpreter for Lazy Programs
inferred← citeshttps://doi.org/10.1007/978-1-4471-3215-8_8openalex-snapshot
A Loop-detecting Interpreter for Lazy, Higher-order Programs
inferred← citeshttps://doi.org/10.1007/978-1-4471-3560-9_15openalex-snapshot
Logimix: A Self-Applicable Partial Evaluator for Prolog
inferred← citeshttps://doi.org/10.1007/978-1-4471-3810-5_2openalex-snapshot
Compiling Laziness by Partial Evaluation
inferred← citeshttps://doi.org/10.1007/978-1-4471-3810-5_8openalex-snapshot
Towards Binding-Time Improvement for Free
inferred← citeshttps://doi.org/10.1007/978-1-4612-2822-6_9openalex-snapshot
Computer Implementation and Applications of Kleene’s S-M-N and Recursion Theorems
inferred← citeshttps://doi.org/10.1007/978-3-319-60074-1_7openalex-snapshot
Structured Program Generation Techniques
inferred← citeshttps://doi.org/10.1007/978-3-319-91908-9_14openalex-snapshot
Methods, Languages and Tools for Future System Development
inferred← citeshttps://doi.org/10.1007/978-3-319-91908-9_17openalex-snapshot
Language-Driven Engineering: From General-Purpose to Purpose-Specific Languages
inferred← citeshttps://doi.org/10.1007/978-3-540-25951-0_11openalex-snapshot
Specialising Interpreters Using Offline Partial Deduction
inferred← citeshttps://doi.org/10.1007/978-3-642-11486-1_12openalex-snapshot
An Experiment with the Fourth Futamura Projection
inferred← citeshttps://doi.org/10.1007/978-3-7091-7533-0_10openalex-snapshot
Speeding Up Back Propagation by Partial Evaluation
inferred← citeshttps://doi.org/10.1007/bf01088695openalex-snapshot
A partial evaluator for the Maruti hard real-time system
inferred← citeshttps://doi.org/10.1007/bf02943176openalex-snapshot
A partial evaluator for a parallel lambda language
inferred← citeshttps://doi.org/10.1007/bf02949826openalex-snapshot
Constraint-based partial evaluation for imperative languages
inferred← citeshttps://doi.org/10.1007/bf03037137openalex-snapshot
Partial evaluation with inference rules
inferred← citeshttps://doi.org/10.1007/bf03037145openalex-snapshot
Annotated bibliography on partial evaluation and mixed computation
inferred← citeshttps://doi.org/10.1007/bf03037257openalex-snapshot
The narrowing-driven approach to functional logic program specialization
inferred← citeshttps://doi.org/10.1007/bf03037500openalex-snapshot
Towards efficient partial evaluation in logic programming
inferred← citeshttps://doi.org/10.1007/bf03037527openalex-snapshot
A general criterion for avoiding infinite unfolding during partial deduction
inferred← citeshttps://doi.org/10.1007/bfb0032064openalex-snapshot
Partial evaluation, self-application and types
inferred← citeshttps://doi.org/10.1007/bfb0053561openalex-snapshot
A polyvariant binding-time analysis for off-line partial deduction
inferred← citeshttps://doi.org/10.1007/bfb0053564openalex-snapshot
Synchronisation analysis to stop tupling
inferred← citeshttps://doi.org/10.1007/bfb0056614openalex-snapshot
Architecture software using: A methodology for language development
inferred← citeshttps://doi.org/10.1007/s00165-005-0077-6openalex-snapshot
A formal relationship between program slicing and partial evaluation
inferred← citeshttps://doi.org/10.1016/0020-0190(89)90113-0openalex-snapshot
Partial evaluation of pattern matching in strings
inferred← citeshttps://doi.org/10.1016/0020-0190(91)90148-bopenalex-snapshot
Semantics-directed compilation of nonlinear patterns
inferred← citeshttps://doi.org/10.1016/0167-6423(91)90002-fopenalex-snapshot
Automatic autoprojection of recursive equations with global variables and abstract data types
inferred← citeshttps://doi.org/10.1016/0167-6423(91)90035-vopenalex-snapshot
Automatic autoprojection of higher order recursive equations
inferred← citeshttps://doi.org/10.1016/0167-6423(93)90011-dopenalex-snapshot
Semantics-directed generation of a prolog compiler
inferred← citeshttps://doi.org/10.1016/0304-3975(91)90299-hopenalex-snapshot
Essence of generalized partial computation
inferred← citeshttps://doi.org/10.1016/0304-3975(91)90301-hopenalex-snapshot
Static semantics, types, and binding time analysis
inferred← citeshttps://doi.org/10.1016/0304-3975(92)90008-4openalex-snapshot
Partial memoization for obtaining linear time behavior of a 2DPDA
inferred← citeshttps://doi.org/10.1016/0743-1066(91)90027-mopenalex-snapshot
Partial evaluation in logic programming
inferred← citeshttps://doi.org/10.1016/0743-1066(93)90026-dopenalex-snapshot
Towards a methodology for the design of abstract machines for logic programming languages
inferred← citeshttps://doi.org/10.1016/b978-0-444-89880-7.50041-3openalex-snapshot
Adding New Rules to an LCF-style Logic Implementation
inferred← citeshttps://doi.org/10.1016/s0096-0551(99)00004-1openalex-snapshot
A sketch-based technique for the derivation of self-interpreters
inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00050-5openalex-snapshot
Extending a partial evaluator which supports separate compilation
inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00054-2openalex-snapshot
Lambda-dropping: transforming recursive equations into programs with block structure
inferred← citeshttps://doi.org/10.1017/s0956796800000058openalex-snapshot
A partial evaluator for the untyped lambda-calculus
inferred← citeshttps://doi.org/10.1017/s0956796800000745openalex-snapshot
On the specialization of online program specializers
inferred← citeshttps://doi.org/10.1017/s0956796800000757openalex-snapshot
Program transformation with metasystem transitions
inferred← citeshttps://doi.org/10.1017/s0956796800000769openalex-snapshot
Efficient analyses for realistic off-line partial evaluation
inferred← citeshttps://doi.org/10.1017/s0956796800001167openalex-snapshot
On the generation of specializers
inferred← citeshttps://doi.org/10.1017/s0956796800001179openalex-snapshot
Safe fusion of functional expressions II: Further improvements
inferred← citeshttps://doi.org/10.1017/s0956796800001453openalex-snapshot
On-line and off-line partial evaluation: semantic specifications and correctness proofs
inferred← citeshttps://doi.org/10.1017/s0956796800001465openalex-snapshot
Semantics directed program execution monitoring
inferred← citeshttps://doi.org/10.1017/s0956796809007205openalex-snapshot
Finally tagless, partially evaluated: Tagless staged interpreters for simpler typed languages
inferred← citeshttps://doi.org/10.1017/s0960129500001535openalex-snapshot
Representing Control: a Study of the CPS Transformation
inferred← citeshttps://doi.org/10.1017/s0960129597002405openalex-snapshot
A computational formalization for partial evaluation
inferred← citeshttps://doi.org/10.1017/s147106840200145xopenalex-snapshot
Logic program specialisation through partial deduction: Control issues
inferred← citeshttps://doi.org/10.1017/s1471068403001662openalex-snapshot
Offline specialisation in Prolog using a hand-written compiler generator
inferred← citeshttps://doi.org/10.1023/a:1010043619517openalex-snapshot
Partial Evaluation of Computation Process, Revisited
inferred← citeshttps://doi.org/10.1023/a:1012992731199openalex-snapshot
The Second Futamura Projection for Type-Directed Partial Evaluation
inferred← citeshttps://doi.org/10.1093/oso/9780198537809.003.0005openalex-snapshot
Abstract interpretation: a semantics-based tool for program analysis
inferred← citeshttps://doi.org/10.1109/2.62091openalex-snapshot
Compiling scientific code using partial evaluation
inferred← citeshttps://doi.org/10.1109/access.2022.3174192openalex-snapshot
An Interactive Interpreter for Two Dimensional Lucid
inferred← citeshttps://doi.org/10.1109/compsac.2008.17openalex-snapshot
XQPE: A Partial Evaluation System for XQuery
inferred← citeshttps://doi.org/10.1109/iccl.1990.63760openalex-snapshot
A self-applicable partial evaluator for the lambda calculus
inferred← citeshttps://doi.org/10.1109/iccl.1994.288382openalex-snapshot
Generating optimizing specializers
inferred← citeshttps://doi.org/10.1109/iccl.1998.674165openalex-snapshot
Controlled self-applicable on-line partial evaluation, using strategies
inferred← citeshttps://doi.org/10.1109/icde60146.2024.00042openalex-snapshot
Incremental Fusion: Unifying Compiled and Vectorized Query Execution
inferred← citeshttps://doi.org/10.1109/real.1991.160359openalex-snapshot
A partial evaluator for the Maruti hard real-time system
inferred← citeshttps://doi.org/10.1109/smc.2018.00273openalex-snapshot
Specialization of Distributed Actors by Partial Evaluation
inferred← citeshttps://doi.org/10.1109/wpc.1993.263907openalex-snapshot
Partial evaluation as an aid to the comprehension of Fortran programs
inferred← citeshttps://doi.org/10.1109/wpc.1994.341266openalex-snapshot
SFAC, a tool for program comprehension by specialization
inferred← citeshttps://doi.org/10.1142/s0129054101000448openalex-snapshot
FROM STANDARD TO NON-STANDARD SEMANTICS BY SEMANTICS MODIFIERS
inferred← citeshttps://doi.org/10.1145/113445.113453openalex-snapshot
Strictness and binding-time analyses
inferred← citeshttps://doi.org/10.1145/113445.113454openalex-snapshot
Parameterized partial evaluation
inferred← citeshttps://doi.org/10.1145/113446.113453openalex-snapshot
Strictness and binding-time analyses
inferred← citeshttps://doi.org/10.1145/113446.113454openalex-snapshot
Parameterized partial evaluation
inferred← citeshttps://doi.org/10.1145/115865.115867openalex-snapshot
Generalized partial computation for a lazy functional language
inferred← citeshttps://doi.org/10.1145/115865.115875openalex-snapshot
Building incremental programs using partial evaluation
inferred← citeshttps://doi.org/10.1145/115865.115879openalex-snapshot
Staging transformations for abstract machines
inferred← citeshttps://doi.org/10.1145/115865.115880openalex-snapshot
Program bifurcation for a polymorphically typed functional language
inferred← citeshttps://doi.org/10.1145/115865.115890openalex-snapshot
Partial evaluation is fuller laziness
inferred← citeshttps://doi.org/10.1145/115865.115898openalex-snapshot
Program transformations for configuring components
inferred← citeshttps://doi.org/10.1145/115865.115900openalex-snapshot
Towards multiple self-application
inferred← citeshttps://doi.org/10.1145/115866.115867openalex-snapshot
Generalized partial computation for a lazy functional language
inferred← citeshttps://doi.org/10.1145/115866.115875openalex-snapshot
Building incremental programs using partial evaluation
inferred← citeshttps://doi.org/10.1145/115866.115880openalex-snapshot
Program bifurcation for a polymorphically typed functional language
inferred← citeshttps://doi.org/10.1145/115866.115890openalex-snapshot
Partial evaluation is fuller laziness
inferred← citeshttps://doi.org/10.1145/128861.128864openalex-snapshot
A self-applicable partial evaluator for the lambda calculus
inferred← citeshttps://doi.org/10.1145/141471.141483openalex-snapshot
Improving binding times without explicit CPS-conversion
inferred← citeshttps://doi.org/10.1145/141471.141494openalex-snapshot
Safe fusion of functional expressions
inferred← citeshttps://doi.org/10.1145/141478.141483openalex-snapshot
Improving binding times without explicit CPS-conversion
inferred← citeshttps://doi.org/10.1145/141478.141494openalex-snapshot
Safe fusion of functional expressions
inferred← citeshttps://doi.org/10.1145/143165.143220openalex-snapshot
Generating a compiler for a lazy language by partial evaluation
inferred← citeshttps://doi.org/10.1145/143165.143223openalex-snapshot
Partial evaluation of high-level imperative programming languages with applications in hard real-time systems
inferred← citeshttps://doi.org/10.1145/1480945.1480954openalex-snapshot
Is there a fourth Futamura projection?
inferred← citeshttps://doi.org/10.1145/1480945.1480956openalex-snapshot
Partially evaluated sensor networks
inferred← citeshttps://doi.org/10.1145/154630.154634openalex-snapshot
Towards efficient partial evaluation
inferred← citeshttps://doi.org/10.1145/154630.154636openalex-snapshot
Binding-time analysis and the taming of C pointers
inferred← citeshttps://doi.org/10.1145/158511.158707openalex-snapshot
Tutorial notes on partial evaluation
inferred← citeshttps://doi.org/10.1145/167088.167244openalex-snapshot
Constant time factors do matter
inferred← citeshttps://doi.org/10.1145/169683.174155openalex-snapshot
Parameterized partial evaluation
inferred← citeshttps://doi.org/10.1145/182409.182483openalex-snapshot
Continuation-based partial evaluation
inferred← citeshttps://doi.org/10.1145/182590.182483openalex-snapshot
Continuation-based partial evaluation
inferred← citeshttps://doi.org/10.1145/183432.183458openalex-snapshot
Operational semantics-directed compilers and machine architectures
inferred← citeshttps://doi.org/10.1145/186025.186037openalex-snapshot
Fixpoint computation for polyvariant static analyses of higher-order applicative programs
inferred← citeshttps://doi.org/10.1145/202453.202472openalex-snapshot
SPIN —an extensible microkernel for application-specific operating system services
inferred← citeshttps://doi.org/10.1145/215465.215554openalex-snapshot
Polyvariant constructor specialisation
inferred← citeshttps://doi.org/10.1145/231379.231429openalex-snapshot
Relocating machine instructions by currying
inferred← citeshttps://doi.org/10.1145/234528.234741openalex-snapshot
Resource-bounded partial evaluation
inferred← citeshttps://doi.org/10.1145/237721.237765openalex-snapshot
C: a language for high-level, efficient, and machine-independent dynamic code generation
inferred← citeshttps://doi.org/10.1145/243439.243447openalex-snapshot
An introduction to partial evaluation
inferred← citeshttps://doi.org/10.1145/249069.231429openalex-snapshot
Relocating machine instructions by currying
inferred← citeshttps://doi.org/10.1145/258915.258934openalex-snapshot
Module-sensitive program specialisation
inferred← citeshttps://doi.org/10.1145/258916.258934openalex-snapshot
Module-sensitive program specialisation
inferred← citeshttps://doi.org/10.1145/258993.258996openalex-snapshot
Partial evaluation and separate compilation
inferred← citeshttps://doi.org/10.1145/258994.258996openalex-snapshot
Partial evaluation and separate compilation
inferred← citeshttps://doi.org/10.1145/3276489openalex-snapshot
AnyDSL: a partial evaluation framework for programming high-performance libraries
inferred← citeshttps://doi.org/10.1145/328690.328695openalex-snapshot
The second Futamura projection for type-directed partial evaluation
inferred← citeshttps://doi.org/10.1145/328691.328695openalex-snapshot
The second Futamura projection for type-directed partial evaluation
inferred← citeshttps://doi.org/10.1145/3635800.3637445openalex-snapshot
The Genesis of Mix: Early Days of Self-Applicable Partial Evaluation (Invited Contribution)
inferred← citeshttps://doi.org/10.1145/3656453openalex-snapshot
Equivalence by Canonicalization for Synthesis-Backed Refactoring
inferred← citeshttps://doi.org/10.1145/43908.43910openalex-snapshot
A bibliography on partial evaluation
inferred← citeshttps://doi.org/10.1145/62678.62725openalex-snapshot
Intensions and extensions in a reflective tower
inferred← citeshttps://doi.org/10.1145/91556.91668openalex-snapshot
Binding time analysis for high order untyped functional languages
inferred← citeshttps://doi.org/10.1145/91556.91672openalex-snapshot
Partial type inference for untyped functional programs
inferred← citeshttps://doi.org/10.1145/91556.91679openalex-snapshot
Incremental reduction in the lambda calculus
inferred← citeshttps://doi.org/10.1145/963778.963784openalex-snapshot
Offline partial evaluation can be as accurate as online partial evaluation
inferred← citeshttps://doi.org/10.1145/99370.99372openalex-snapshot
Separating binding times in language specifications
inferred← citeshttps://doi.org/10.1145/99370.99374openalex-snapshot
Replacing function parameters by global variables
inferred← citeshttps://doi.org/10.1145/99583.99587openalex-snapshot
A theory of incremental computation and its application
inferred← citeshttps://doi.org/10.1145/99583.99588openalex-snapshot
Static and dynamic semantics processing
inferred← citeshttps://doi.org/10.20948/abrau-2022-18openalex-snapshot
Specialization of interpreters written in object-oriented languages can be effective
inferred← citeshttps://doi.org/10.21236/ada324006openalex-snapshot
Programming and Proving with Function and Control Abstractions,
inferred← citeshttps://doi.org/10.25209/2079-3316-2020-11-1-3-29openalex-snapshot
The JaSpe specializer: an algorithm of intra-procedural binding time analysis for programs in Java language subset
inferred← citeshttps://doi.org/10.25209/2079-3316-2022-13-4-111-137openalex-snapshot
Efficiency Investigation of BT-Object Based Partial Evaluation of Interpreters Written in the Java Object-Oriented Language
inferred← citeshttps://doi.org/10.35537/10915/4170openalex-snapshot
Type specialisation of polymorphic languages
inferred← citeshttps://doi.org/10.3990/1.9789036530286openalex-snapshot
concise and flexible programmng of wireless sensor networks
inferred← citeshttps://doi.org/10.4204/eptcs.129.10openalex-snapshot
Online partial evaluation of sheet-defined functions
inferred← citeshttps://doi.org/10.4995/thesis/10251/17655openalex-snapshot
Evaluación Parcial Offline Dirigida por Narrowing: Técnicas de Optimización y Aplicaciones
showing the first 200 of 220 · page through all 220
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.