Normal forms in combinatory logic
type: Item
instance of: scholarly article
title: Normal forms in combinatory logic
zbMATH Open document ID: 0830.03005
author: Patricia Johann
published in: Notre Dame Journal of Formal Logic
publication date: 1996-01-30T00:00:00Z
Mathematics Subject Classification ID: 03B40
zbMATH DE Number: 820131
zbMATH Keywords: term rewriting system
zbMATH Keywords: combinatory logic
zbMATH Keywords: lambda calculus
zbMATH Keywords: reduction relation
zbMATH Keywords: normal form
MaRDI profile type: Publication
full work available at URL: https://doi.org/10.1305/ndjfl/1040408614
OpenAlex ID: W2028830311
cites work: The lambda calculus. Its syntax and semantics. Rev. ed.
cites work: Polymorphic rewriting conserves algebraic strong normalization
cites work: Polymorphic rewriting conserves algebraic confluence
cites work: Combinatory logic. With two sections by William Craig.
cites work: Combinatory logic. Vol. II
cites work: Q4385532
cites work: Adding algebraic rewriting to the untyped lambda calculus
cites work: A combinatory logic approach to higher-order E-unification
cites work: Higher-order unification revisited: Complete sets of transformations
cites work: Axioms for strong reduction in combinatory logic
cites work: Combinatory Reductions and Lambda Reductions Compared
cites work: A Short Proof of Curry's Normal Form Theorem
cites work: Q5686017
cites work: Q4722037
cites work: A unification algorithm for typed \(\overline\lambda\)-calculus
cites work: Q3918095
cites work: The decidability of hindley's axioms for strong reduction
cites work: Strong reduction and normal form in combinatory logic
cites work: On pseudo-c\(\beta\) normal form in combinatory logic
cites work: Q3779784
DOI: 10.1305/NDJFL/1040408614
description: scientific article; zbMATH DE number 820131