The following pages link to Refal (Q39349):
Displayed 41 items.
- A regeneration scheme for generating extensions (Q290228) (← links)
- Proving properties of functional programs by equality saturation (Q300342) (← links)
- Supercompilation for Martin-Lof's type theory (Q300348) (← links)
- Reverse universal resolving algorithm and inverse driving (Q444478) (← links)
- Proving the correctness of recursion-based automatic program transformations (Q671683) (← links)
- Ping-pong protocols as prefix grammars: modelling and verification via program transformation (Q739638) (← links)
- Semantics of algorithmic languages (Q760200) (← links)
- Essence of generalized partial computation (Q808278) (← links)
- Derivation of efficient logic programs by specialization and reduction of nondeterminism (Q815006) (← links)
- Reflection in membership equational logic, many-sorted equational logic, Horn logic with equality, and rewriting logic (Q875516) (← links)
- Flow analysis of lazy higher-order functional programs (Q879358) (← links)
- Mixed computation and compilation: New approaches to old problems (Q912601) (← links)
- An improved reductant calculus using fuzzy partial evaluation techniques (Q1037854) (← links)
- Annotated bibliography on partial evaluation and mixed computation (Q1104069) (← links)
- Mixed computation of Prolog programs (Q1108777) (← links)
- On the transformation of logic programs with instantiation based computation rules (Q1119029) (← links)
- Methods and programs for generating random graphs (Q1149165) (← links)
- A survey of scheduling methods for multiprocessor systems (Q1153687) (← links)
- Mixed computation: potential applications and problems for study (Q1169808) (← links)
- Static semantics, types, and binding time analysis (Q1179698) (← links)
- Problem-oriented verification system and its application to linear algebra programs (Q1311971) (← links)
- Extending a partial evaluator which supports separate compilation (Q1583351) (← links)
- Reflection in conditional rewriting logic (Q1608918) (← links)
- NP-completeness conditions for consistency verification of some types of systems of linear Diophantine dis-equations (Q1709490) (← links)
- On one application of computations with oracle (Q1758675) (← links)
- Higher-level supercompilation as a metasystem transition (Q1758721) (← links)
- Intermediate representation of programs with type specification based on pattern matching (Q2217191) (← links)
- Verification as a parameterized testing (experiments with the SCP4 supercompiler) (Q2371554) (← links)
- Closed-form upper bounds in static cost analysis (Q2429987) (← links)
- Multiple data structuring (Q2432992) (← links)
- On difference schemes of third order accuracy for nonlinear hyperbolic systems (Q2546300) (← links)
- Horn Clause Solvers for Program Verification (Q2947164) (← links)
- Interleaving Symbolic Execution and Partial Evaluation (Q3066122) (← links)
- REACHABILITY ANALYSIS IN VERIFICATION VIA SUPERCOMPILATION (Q3526545) (← links)
- (Q4339951) (← links)
- (Q4706767) (← links)
- (Q5020656) (← links)
- (Q5020657) (← links)
- Rewriting techniques for program synthesis (Q5055734) (← links)
- The narrowing-driven approach to functional logic program specialization (Q5957056) (← links)
- Program transformation system based on generalized partial computation (Q5957059) (← links)