| Confluent Term Rewriting Systems Generalized Innermost Rewriting Orderings for Innermost Termmation Leanest Quasi-orderings Abstract Modularity Union of Equational Theories: An Algebraic Approach Equivariant Unification Faster Basic Syntactic Mutation with Sorts for Some Separable Equational Theories Unification in a Class of Permutative Theories Dependency Pairs for Simply Typed Term Rewriting Universal Algebra for Termination of Higher-Order Rewriting Quasi-interpretations and Small Space Bounds A Sufficient Completeness Reasoning Tool for Partial Specifications Tyrolean Termination Tool Call-by-Value Is Dual to Call-by-Name - Reloaded λu-Calculus and Duality: Call-by-Name and Call-by-Value Reduction in a Linear Lambda-Calculus with Applications to Operational Semantics Higher-Order Matching in the Linear Lambda Calculus in the Absence of Constants Is NP-Complete Localized Fairness: A Rewriting Semantics Partial Inversion of Constructor Term Rewriting Systems Natural Narrowing for General Term Rewriting Systems The Finite Variant Property: How to Get Rid of Some Algebraic Properties Intruder Deduction for AC-Like Equational Theories with Homomorphisms Proving Positive Almost-Sure Termination Termination of Single-Threaded One-Rule Semi-Thue Systen On Tree Automata that Certify Termination of Left-Linear Term Rewriting Systems Twenty Years Later Open. Closed. Open A Tutorial Example of the Semantic Approach to Foundational Proof-Carrying Code …… Author Index |
内容加载中，请稍后...
商品评论（0条）