Perpetuality and uniform normalization in orthogonal rewrite systems
type: Item
instance of: scholarly article
title: Perpetuality and uniform normalization in orthogonal rewrite systems
zbMATH Open document ID: 1003.68057
author: Zurab Khasidashvili
author: Mizuhito Ogawa
author: Vincent van Oostrom
published in: Information and Computation
publication date: 2003-01-14T00:00:00Z
Mathematics Subject Classification ID: 68Q42
Mathematics Subject Classification ID: 03B40
zbMATH DE Number: 1853148
describes a project that uses: Automath
MaRDI profile type: Publication
OpenAlex ID: W2082484253
cites work: Q4281490
cites work: The lambda calculus. Its syntax and semantics. Rev. ed.
cites work: Q4023825
cites work: Q3674616
cites work: Conditional rewrite rules: Confluence and termination
cites work: The ant-lion paradigm for strong normalization
cites work: Q3819993
cites work: On termination and confluence properties of disjoint and constructor-sharing conditional rewrite systems
cites work: Q4281472
cites work: Higher-order narrowing with definitional trees
cites work: Q4260372
cites work: Semantical analysis of perpetual strategies in \(\lambda\)-calculus
cites work: Q4297316
cites work: Q3707989
cites work: Q3202988
cites work: Optimal normalization in orthogonal term rewriting systems
cites work: Q4954449
cites work: Q4942642
cites work: Q4501151
cites work: On the longest perpetual reductions in orthogonal expression reduction systems
cites work: Q4222804
cites work: Q4364379
cites work: Q3918095
cites work: Combinatory reduction systems: Introduction and survey
cites work: The Mechanical Evaluation of Expressions
cites work: Q3024911
cites work: Q3922646
cites work: Higher-order rewrite systems and their confluence
cites work: Functions as processes
cites work: Conservation and uniform normalization in lambda calculi with erasing reductions
cites work: Q4281481
cites work: Computing in systems described by equations
cites work: Higher-order families
cites work: Finite family developments
cites work: Q4501166
cites work: Q4254556
cites work: Polynomial time termination and constraint satisfaction tests
cites work: Call-by-name, call-by-value and the \(\lambda\)-calculus
cites work: Perpetual reductions in \(\lambda\)-calculus
cites work: Q4511325
cites work: Effective longest and infinite reduction paths in untyped λ-calculi
cites work: Strong normalization from weak normalization in typed \(\lambda\)-calculi
cites work: Q3819991
cites work: Q4716271
cites work: Q3783265
cites work: The Clausal Theory of Types
cites work: Q3024920
DOI: 10.1006/INCO.2000.2888
description: scientific article; zbMATH DE number 1853148