The following pages link to (Q4799892):
Displaying 50 items.
- Bridging Curry and Church's typing style (Q334149) (← links)
- Rota's classification problem, rewriting systems and Gröbner-Shirshov bases (Q335602) (← links)
- Dependency pairs for proving termination properties of conditional term rewriting systems (Q347382) (← links)
- On unification and admissible rules in Gabbay-de Jongh logics (Q386639) (← links)
- Higher-dimensional normalisation strategies for acyclicity (Q456807) (← links)
- State space reduction in the Maude-NRL protocol analyzer (Q462493) (← links)
- Exploring conditional rewriting logic computations (Q485831) (← links)
- Beyond polynomials and Peano arithmetic -- automation of elementary and ordinal interpretations (Q485843) (← links)
- Symbol different term rewrite systems (Q492918) (← links)
- Free integro-differential algebras and Gröbner-Shirshov bases. (Q493010) (← links)
- On equal \(\mu \)-terms (Q549186) (← links)
- Lazy productivity via termination (Q549188) (← links)
- The correctness of Newman's typability algorithm and some of its extensions (Q549191) (← links)
- Infinitary combinatory reduction systems (Q550248) (← links)
- Proving weak properties of rewriting (Q554217) (← links)
- On the verification of membrane systems with dynamic structure (Q609035) (← links)
- A formalization of the Knuth-Bendix(-Huet) critical pair theorem (Q616850) (← links)
- Complete sets of cooperations (Q618169) (← links)
- Levels of undecidability in rewriting (Q627134) (← links)
- Finite complete rewriting systems for regular semigroups. (Q627163) (← links)
- Strict coherence of conditional rewriting modulo axioms (Q683741) (← links)
- Termination in higher-order concurrent calculi (Q710674) (← links)
- Characterizing and proving operational termination of deterministic conditional term rewriting systems (Q710679) (← links)
- Normal forms and normal theories in conditional rewriting (Q730473) (← links)
- Debugging Maude programs via runtime assertion checking and trace slicing (Q739630) (← links)
- De Bruijn's weak diamond property revisited (Q740482) (← links)
- Bottom-up rewriting for words and terms (Q741256) (← links)
- CHAP and rewrite components (Q766175) (← links)
- Abstract abstract reduction (Q817587) (← links)
- Formal design and verification of operational transformation algorithms for copies convergence (Q820129) (← links)
- Productivity of stream definitions (Q846366) (← links)
- Proving termination of context-sensitive rewriting by transformation (Q859833) (← links)
- A rewriting-based inference system for the NRL protocol analyzer and its meta-logical properties (Q860906) (← links)
- Tool-assisted specification and verification of typed low-level languages (Q861687) (← links)
- Resource operators for \(\lambda\)-calculus (Q876041) (← links)
- Tyrolean termination tool: techniques and features (Q876042) (← links)
- On tree automata that certify termination of left-linear term rewriting systems (Q876043) (← links)
- Infinitary rewriting: meta-theory and convergence (Q884993) (← links)
- Termination of rewrite relations on \(\lambda\)-terms based on Girard's notion of reducibility (Q896904) (← links)
- Termination of just/fair computations in term rewriting (Q924727) (← links)
- Lambda calculus with patterns (Q930865) (← links)
- Programming with narrowing: a tutorial (Q968524) (← links)
- Reducibility of operation symbols in term rewriting systems and its application to behavioral specifications (Q968529) (← links)
- A compact fixpoint semantics for term rewriting systems (Q987981) (← links)
- A study of substitution, using nominal techniques and Fraenkel-Mostowksi sets (Q1006642) (← links)
- Meadows and the equational specification of division (Q1006649) (← links)
- Applications of infinitary lambda calculus (Q1021568) (← links)
- On the completeness of order-theoretic models of the \(\lambda \)-calculus (Q1021569) (← links)
- Strong and NV-sequentiality of constructor systems (Q1029079) (← links)
- Termination of narrowing revisited (Q1035697) (← links)
