Reduction strategy (code optimization)
Semantic Scholar uses AI to extract papers important to this topic.
In the context of the Energy Internet, customers are supplied by energy hubs (EH), while the EHs are interconnected through an… Expand Data schema transformations occur in the context of software evolution, refactoring, and cross-paradigm data mappings. When… Expand Sharing graphs are a tool for the implementation of graph rewriting systems whose rules may require the duplication, the… Expand A reachability problem is a problem used to decide whether s is reachable to tby Ror not for a given two terms s, tand a term… Expand Abstract
We present a particularly simple lazy lambda-calculus machine, which was introduced twenty-five years ago. It has been… Expand We survey a substantial body of knowledge about lambda calculus and Pure Type Systems, formally developed in a constructive type… Expand rewriting system, 16 irreflexive, 33 weakly irreflexive, 33 with typing, 37, 40 with very weak typing, 40 with weak typing, 40… Expand We introduce a class of restrictions for the ordered paramodulation and superposition calculi (inspired by the basic strategy for… Expand We present the complete development, in Gallina, of the residual theory of b-reduction in pure l-calculus. The main result is the… Expand