Pages that link to "Item:Q1893727"

The following pages link to Transfinite reductions in orthogonal term rewriting systems (Q1893727):

Displaying 50 items.

• Lazy productivity via termination (Q549188) (← links)
• Metrics for weighted transition systems: axiomatization and complexity (Q549202) (← links)
• Infinitary combinatory reduction systems (Q550248) (← links)
• Properties of a first-order functional language with sharing (Q673126) (← links)
• Transfinite semantics in the form of greatest fixpoint (Q843215) (← links)
• Productivity of stream definitions (Q846366) (← links)
• Proving termination of context-sensitive rewriting by transformation (Q859833) (← links)
• Termination of just/fair computations in term rewriting (Q924727) (← links)
• A trajectory-based strict semantics for program slicing (Q960858) (← links)
• A non-standard semantics for program slicing and dependence analysis (Q997995) (← links)
• Applications of infinitary lambda calculus (Q1021568) (← links)
• Sequentiality in orthogonal term rewriting systems (Q1186735) (← links)
• Infinite \(\lambda\)-calculus and types (Q1275621) (← links)
• Lambda calculus with explicit recursion (Q1383145) (← links)
• Interaction nets and term-rewriting systems (Q1389438) (← links)
• Computing in unpredictable environments: semantics, reduction strategies, and program transformations (Q1389440) (← links)
• Infinitary lambda calculus (Q1392145) (← links)
• Projections for infinitary rewriting (Q1744449) (← links)
• Computable total functions on metric algebras, universal algebraic specifications and dynamical systems (Q1764798) (← links)
• Descendants and origins in term rewriting. (Q1854348) (← links)
• Perpetuality and uniform normalization in orthogonal rewrite systems (Q1854401) (← links)
• Context-sensitive rewriting strategies (Q1854569) (← links)
• Infinitary lambda calculus and discrimination of Berarducci trees. (Q1874272) (← links)
• Relating graph and term rewriting via Böhm models (Q1924551) (← links)
• Highlights in infinitary rewriting and lambda calculus (Q1929230) (← links)
• Counterexamples in infinitary rewriting with non-fully-extended rules (Q1944100) (← links)
• Infinitary rewriting: closure operators, equivalences and models (Q2376981) (← links)
• On confluence and residuals in Cauchy convergent transfinite rewriting (Q2390300) (← links)
• Projections for infinitary rewriting (extended version) (Q2424890) (← links)
• On modularity in infinitary term rewriting (Q2496298) (← links)
• (Q2778880) (← links)
• Transformation of shaped nested graphs and diagrams (Q2841248) (← links)
• On term-graph rewrite strategies (Q2873679) (← links)
• On Normalisation of Infinitary Combinatory Reduction Systems (Q3522017) (← links)
• Normalization of Infinite Terms (Q3522036) (← links)
• A term-graph clausal logic: completeness and incompleteness results ★ (Q3643364) (← links)
• (Q3719825) (← links)
• Termination and confluence in infinitary term rewriting (Q4254682) (← links)
• Convergence in infinitary term graph rewriting systems is simple (Q4585010) (← links)
• (Q4600775) (← links)
• Term graph rewriting (Q4645801) (← links)
• Categorical rewriting of term-like structures (Q4923533) (← links)
• Term rewriting in CTΣ (Q5044755) (← links)
• Transfinite reductions in orthogonal term rewriting systems (Q5055744) (← links)
• Redex capturing in term graph rewriting (concise version) (Q5055745) (← links)
• More problems in rewriting (Q5055812) (← links)
• Infinitary lambda calculi and böhm models (Q5055835) (← links)
• (Q5089021) (← links)
• (Q5094133) (← links)
• Rational rewriting (Q5096902) (← links)