Infinitary combinatory reduction systems

DOI10.1016/J.IC.2011.01.007zbMATH Open1235.68095OpenAlexW1994588735MaRDI QIDQ550248FDOQ550248

Authors: Jeroen Ketema, Jakob Grue Simonsen 

Publication date: 8 July 2011

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ic.2011.01.007

Recommendations

• Term Rewriting and Applications
• Infinitary combinatory reduction systems: confluence
• On Confluence of Infinitary Combinatory Reduction Systems
• Infinitary combinatory reduction systems: normalising reduction strategies
• Combinatory reduction systems: Introduction and survey

zbMATH Keywords

combinatory reduction systemshigher-order term rewritinginfinitary rewriting

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Combinatory logic and lambda calculus (03B40)

Cites Work

• Title not available (Why is that?)
• Initial Algebra Semantics and Continuous Algebras
• Combinatory reduction systems: Introduction and survey
• Title not available (Why is that?)
• Fundamental properties of infinite trees
• Title not available (Why is that?)
• Title not available (Why is that?)
• Higher-order rewrite systems and their confluence
• Title not available (Why is that?)
• Infinitary lambda calculus
• Infinitary lambda calculus and discrimination of Berarducci trees.
• Title not available (Why is that?)
• Minimal and Optimal Computations of Recursive Programs
• Title not available (Why is that?)
• Rewrite, rewrite, rewrite, rewrite, rewrite, \dots
• Transfinite reductions in orthogonal term rewriting systems
• On modularity in infinitary term rewriting
• A rewriting calculus for cyclic higher-order term graphs
• Infinitary normalization
• REDEX CAPTURING IN TERM GRAPH REWRITING
• Infinitary combinatory reduction systems: confluence
• Infinitary combinatory reduction systems: normalising reduction strategies
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Higher-order narrowing with definitional trees
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Higher-order families
• On Confluence of Infinitary Combinatory Reduction Systems
• Infinite unfolding and transformations of nondeterministic programs
• Term Rewriting and Applications
• Processes, Terms and Cycles: Steps on the Road to Infinity
• Rewriting Techniques and Applications
• Paths, computations and labels in the \(\lambda\)-calculus
• Flow analysis of lazy higher-order functional programs
• Infinitary rewriting: meta-theory and convergence

Cited In (13)

• On Confluence of Infinitary Combinatory Reduction Systems
• Term Rewriting and Applications
• Reinterpreting compression in infinitary rewriting
• Title not available (Why is that?)
• Computing with Infinite Terms and Infinite Reductions
• Infinitary combinatory reduction systems: confluence
• Infinitary combinatory reduction systems: normalising reduction strategies
• Title not available (Why is that?)
• Wadge reducibility and infinite computations
• Highlights in infinitary rewriting and lambda calculus
• Title not available (Why is that?)
• On Normalisation of Infinitary Combinatory Reduction Systems
• Comparing Böhm-Like Trees

This page was built for publication: Infinitary combinatory reduction systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q550248)