|
|
Sold Out
Book Categories |
| Origin Tracking in Term Rewriting | 1 | |
| Simultaneous Critical Pairs and Church-Rosser Property | 2 | |
| Church-Rosser Theorems for Abstract Reduction Modulo an Equivalence Relation | 17 | |
| Automatic Monoids versus Monoids with Finite Convergent Presentations | 32 | |
| Decidable and Undecidable Second-Order Unification Problems | 47 | |
| On the Exponent of Periodicity of Minimal Solutions of Context Equations | 61 | |
| Unification in Extensions of Shallow Equational Theories | 76 | |
| Unification and Matching in Process Algebras | 91 | |
| E-Unification for Subsystems of S4 | 106 | |
| Solving Disequations Modulo Some Class of Rewrite Systems | 121 | |
| About Proofs by Consistency | 136 | |
| Normalization of S-Terms is Decidable | 138 | |
| Decidable Approximations of Sets of Descendants and Sets of Normal Forms | 151 | |
| Algorithms and Reductions for Rewriting Problems | 166 | |
| The Decidability of Simultaneous Rigid E-Unification with One Variable | 181 | |
| Ordering Constraints over Feature Trees Expressed in Second-Order Monadic Logic | 196 | |
| Co-definite Set Constraints | 211 | |
| Modularity of Termination Using Dependency Pairs | 226 | |
| Termination of Associative-Commutative Rewriting by Dependency Pairs | 241 | |
| Termination Transformation by Tree Lifting Ordering | 256 | |
| Towards Automated Termination Proofs Through "Freezing" | 271 | |
| Higher-Order Rewriting and Partial Evaluation | 286 | |
| SN Combinators and Partial Combinatory Algebras | 302 | |
| Coupling Saturation-Based Provers by Exchanging Positive/Negative Information | 317 | |
| An On-line Problem Database | 332 | |
| Author Index | 343 |
| Price | Condition | Delivery | Seller | Action |
| $99.99 | Digital |
| WonderClub |
Luca Corvi
reviewed Rewriting Techniques and Applications, Vol. 137 on December 19, 2015
Rewriting Techniques and Applications, Vol. 137
This has to be the best book I have ever read on beginning programming. It actually teaches you as if you have never done programming before, what a new concept for a beginning programming book right? Every other beginners book I have read seemed to think that people just learning, where born writing If Then statement, counting in binary and turning their shopping lists into arrays.
I hate to break it to authors, but the average beginner doesn't even know what I just said. (This are just programming techniques and word, that you really don't need to know about unless you are learning programming, for all those unfortunate people like myself who where not born with this knowledge).
So if you want to learn programming, and didn't grow up fixing bugs on Windows yourself, this is the book to read.
Login|Complaints|Blog|Games|Digital Media|Souls|Obituary|Contact Us|FAQ
CAN'T FIND WHAT YOU'RE LOOKING FOR? CLICK HERE!!! X
You must be logged in to add to WishlistX
This item is in your Wish List
X
This item is in your Collection
Rewriting Techniques and Applications, Vol. 137
X
This Item is in Your Inventory
Rewriting Techniques and Applications, Vol. 137
X
You must be logged in to review the productsX
X
X
Add Rewriting Techniques and Applications, Vol. 137, This book constitutes the refereed proceedings of the 9th International Conference on Rewriting Techniques and Applications, RTA-98, held in Tsukuba, Japan, in March/April 1998. The 22 revised full papers presented were carefully selected from a total of , Rewriting Techniques and Applications, Vol. 137 to the inventory that you are selling on WonderClubX
X
Add Rewriting Techniques and Applications, Vol. 137, This book constitutes the refereed proceedings of the 9th International Conference on Rewriting Techniques and Applications, RTA-98, held in Tsukuba, Japan, in March/April 1998. The 22 revised full papers presented were carefully selected from a total of , Rewriting Techniques and Applications, Vol. 137 to your collection on WonderClub |
