Perpetuality and uniform normalization in orthogonal rewrite systems

DOI10.1006/INCO.2000.2888zbMATH Open1003.68057OpenAlexW2082484253MaRDI QIDQ1854401FDOQ1854401

Authors: Zurab Khasidashvili, Mizuhito Ogawa, Vincent van Oostrom 

Publication date: 14 January 2003

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

Full work available at URL: https://semanticscholar.org/paper/5d6161c8ceb76b2e93153bc051c2b882de0ce017

Recommendations

• scientific article; zbMATH DE number 1088031
• scientific article; zbMATH DE number 1722703
• On the longest perpetual reductions in orthogonal expression reduction systems
• On Normalisation of Infinitary Combinatory Reduction Systems
• Transfinite reductions in orthogonal term rewriting systems

Mathematics Subject Classification ID

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

Cites Work

• Call-by-name, call-by-value and the \(\lambda\)-calculus
• Functions as processes
• The lambda calculus. Its syntax and semantics. Rev. ed.
• Perpetual reductions in \(\lambda\)-calculus
• Combinatory reduction systems: Introduction and survey
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Conditional rewrite rules: Confluence and termination
• The Mechanical Evaluation of Expressions
• Higher-order rewrite systems and their confluence
• Title not available (Why is that?)
• The Clausal Theory of Types
• On termination and confluence properties of disjoint and constructor-sharing conditional rewrite systems
• Computing in systems described by equations
• Title not available (Why is that?)
• Title not available (Why is that?)
• Higher-order narrowing with definitional trees
• Title not available (Why is that?)
• Higher-order families
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Polynomial time termination and constraint satisfaction tests
• Title not available (Why is that?)
• Strong normalization from weak normalization in typed \(\lambda\)-calculi
• Title not available (Why is that?)
• Title not available (Why is that?)
• Semantical analysis of perpetual strategies in \(\lambda\)-calculus
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• The ant-lion paradigm for strong normalization
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Effective longest and infinite reduction paths in untyped λ-calculi
• Title not available (Why is that?)
• Finite family developments
• Optimal normalization in orthogonal term rewriting systems
• On the longest perpetual reductions in orthogonal expression reduction systems
• Title not available (Why is that?)
• Title not available (Why is that?)
• Conservation and uniform normalization in lambda calculi with erasing reductions
• Title not available (Why is that?)

Cited In (5)

• Conservation and uniform normalization in lambda calculi with erasing reductions
• Title not available (Why is that?)
• On the longest perpetual reductions in orthogonal expression reduction systems
• Uniform rewriting based on permutations
• Encoding the factorisation calculus

Uses Software

• Automath

This page was built for publication: Perpetuality and uniform normalization in orthogonal rewrite systems

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