Perpetuality and uniform normalization in orthogonal rewrite systems

DOI10.1006/inco.2000.2888zbMath1003.68057OpenAlexW2082484253MaRDI QIDQ1854401

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

Mathematics Subject Classification ID

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

Related Items (3)

Unnamed Item ⋮ On the longest perpetual reductions in orthogonal expression reduction systems ⋮ Conservation and uniform normalization in lambda calculi with erasing reductions

Uses Software

• Automath

Cites Work

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

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