Titlebook: Logic-Based Program Synthesis and Transformation; 19th International S Danny Schreye Conference proceedings 2010 Springer-Verlag Berlin Hei

脾氣好

書目名稱Logic-Based Program Synthesis and Transformation影響因子(影響力)




書目名稱Logic-Based Program Synthesis and Transformation影響因子(影響力)學(xué)科排名




書目名稱Logic-Based Program Synthesis and Transformation網(wǎng)絡(luò)公開度




書目名稱Logic-Based Program Synthesis and Transformation網(wǎng)絡(luò)公開度學(xué)科排名




書目名稱Logic-Based Program Synthesis and Transformation被引頻次




書目名稱Logic-Based Program Synthesis and Transformation被引頻次學(xué)科排名




書目名稱Logic-Based Program Synthesis and Transformation年度引用




書目名稱Logic-Based Program Synthesis and Transformation年度引用學(xué)科排名




書目名稱Logic-Based Program Synthesis and Transformation讀者反饋




書目名稱Logic-Based Program Synthesis and Transformation讀者反饋學(xué)科排名

安撫

Acquired

埋葬

Ambulatory

MURKY

Goal-Directed and Relative Dependency Pairs for Proving the Termination of Narrowing, powerful approach to analyzing the termination of ., an extension of rewriting that replaces matching with unification in order to deal with logic variables. Our approach could also be useful in other contexts where considering termination w.r.t. a given set of terms is also natural (e.g., proving the termination of functional programs).

CLAMP

reflection

colony

Phenothiazines

On Inductive and Coinductive Proofs via Unfold/Fold Transformations,ble by the coinductive proof rules by Jaffar et al. To this end, we propose a new replacement rule, called . replacement, which is not necessarily equivalence-preserving, but is essential to perform a reasoning step corresponding to coinduction.