Refal
From MaRDI portal
Software:39349
swMATH27634MaRDI QIDQ39349FDOQ39349
Author name not available (Why is that?)
Official website: http://www.refal.net/index_e.htm
Cited In (42)
- REACHABILITY ANALYSIS IN VERIFICATION VIA SUPERCOMPILATION
- Multiple data structuring
- The narrowing-driven approach to functional logic program specialization
- Intermediate representation of programs with type specification based on pattern matching
- Reflection in conditional rewriting logic
- Closed-form upper bounds in static cost analysis
- Program transformation system based on generalized partial computation
- Flow analysis of lazy higher-order functional programs
- Horn clause solvers for program verification
- A regeneration scheme for generating extensions
- Annotated bibliography on partial evaluation and mixed computation
- Proving properties of functional programs by equality saturation
- Supercompilation for Martin-Lof's type theory
- Reverse universal resolving algorithm and inverse driving
- An improved reductant calculus using fuzzy partial evaluation techniques
- Ping-pong protocols as prefix grammars: modelling and verification via program transformation
- Methods and programs for generating random graphs
- A survey of scheduling methods for multiprocessor systems
- Rewriting techniques for program synthesis
- Title not available (Why is that?)
- Title not available (Why is that?)
- DPPD
- Semantics of algorithmic languages
- Higher-level supercompilation as a metasystem transition
- Static semantics, types, and binding time analysis
- On one application of computations with oracle
- Mixed computation and compilation: New approaches to old problems
- Mixed computation of Prolog programs
- Title not available (Why is that?)
- Verification as a parameterized testing (experiments with the SCP4 supercompiler)
- Title not available (Why is that?)
- Problem-oriented verification system and its application to linear algebra programs
- Interleaving symbolic execution and partial evaluation
- Reflection in membership equational logic, many-sorted equational logic, Horn logic with equality, and rewriting logic
- Essence of generalized partial computation
- Mixed computation: potential applications and problems for study
- NP-completeness conditions for consistency verification of some types of systems of linear Diophantine dis-equations
- Derivation of efficient logic programs by specialization and reduction of nondeterminism
- On the transformation of logic programs with instantiation based computation rules
- Extending a partial evaluator which supports separate compilation
- On difference schemes of third order accuracy for nonlinear hyperbolic systems
- Proving the correctness of recursion-based automatic program transformations
This page was built for software: Refal
