Pages that link to "Item:Q1314356"
From MaRDI portal
The following pages link to Combinatory reduction systems: Introduction and survey (Q1314356):
Displaying 50 items.
- Higher-order interpretations and program complexity (Q276254) (← links)
- A metamodel of access control for distributed environments: applications and properties (Q462495) (← links)
- Abstract reduction systems and idea of Knuth-Bendix completion algorithm (Q467811) (← links)
- Infinitary combinatory reduction systems (Q550248) (← links)
- A prismoid framework for languages with resources (Q654907) (← links)
- Intersection type assignment systems with higher-order algebraic rewriting (Q672048) (← links)
- Introducing \(\llparenthesis\lambda\rrparenthesis\), a \(\lambda \)-calculus for effectful computation (Q831147) (← links)
- Expressing combinatory reduction systems derivations in the rewriting calculus (Q857913) (← links)
- Termination of rewrite relations on \(\lambda\)-terms based on Girard's notion of reducibility (Q896904) (← links)
- Capture-avoiding substitution as a nominal algebra (Q939160) (← links)
- Gödel's system \(\mathcal T\) revisited (Q960861) (← links)
- Matching and alpha-equivalence check for nominal terms (Q980937) (← links)
- On the confluence of lambda-calculus with conditional rewriting (Q987976) (← links)
- Higher-order rewrite systems and their confluence (Q1127334) (← links)
- Order-sorted inductive types (Q1286367) (← links)
- Combining algebraic rewriting, extensional lambda calculi, and fixpoints (Q1349901) (← links)
- Interaction systems II: The practice of optimal reductions (Q1350498) (← links)
- Strong normalization from weak normalization in typed \(\lambda\)-calculi (Q1357009) (← links)
- Lambda calculus with explicit recursion (Q1383145) (← links)
- Computing in unpredictable environments: semantics, reduction strategies, and program transformations (Q1389440) (← links)
- Developing developments (Q1392147) (← links)
- Theorem proving modulo (Q1431339) (← links)
- Confluence of extensional and non-extensional \(\lambda\)-calculi with explicit substitutions (Q1575247) (← links)
- Checking overlaps of nominal rewriting rules (Q1744404) (← links)
- Normalisation for higher-order calculi with explicit substitutions (Q1770414) (← links)
- Descendants and origins in term rewriting. (Q1854348) (← links)
- Perpetuality and uniform normalization in orthogonal rewrite systems (Q1854401) (← links)
- Normal forms in combinatory logic (Q1903133) (← links)
- Counterexamples in infinitary rewriting with non-fully-extended rules (Q1944100) (← links)
- Logical foundations for hybrid type-logical grammars (Q2135950) (← links)
- Nominal rewriting (Q2373703) (← links)
- On explicit substitution with names (Q2392486) (← links)
- Expression reduction systems with patterns (Q2467565) (← links)
- Nominal Confluence Tool (Q2817917) (← links)
- Introducing a Calculus of Effects and Handlers for Natural Language Semantics (Q2835059) (← links)
- Rewriting calculus with(out) types (Q2851046) (← links)
- A framework for defining logical frameworks (Q2864157) (← links)
- From functional programs to interaction nets via the rewriting calculus (Q2864528) (← links)
- The power of closed reduction strategies (Q2866800) (← links)
- Complete laziness: a natural semantics (Q2873681) (← links)
- Token-passing nets for functional languages (Q2873684) (← links)
- Three Syntactic Theories for Combinatory Graph Reduction (Q3003482) (← links)
- The algebra of recursive graph transformation language UnCAL: complete axiomatisation and iteration categorical semantics (Q3130301) (← links)
- Harnessing First Order Termination Provers Using Higher Order Dependency Pairs (Q3172889) (← links)
- Strong normalisation in two Pure Pattern Type Systems (Q3520143) (← links)
- On Normalisation of Infinitary Combinatory Reduction Systems (Q3522017) (← links)
- Comparing Böhm-Like Trees (Q3636829) (← links)
- On the Relation between Sized-Types Based Termination and Semantic Labelling (Q3644746) (← links)
- (Q3988401) (← links)
- (Q4249892) (← links)
