Confluence results for the pure strong categorical logic CCL. \(\lambda\)- calculi as subsystems of CCL
type: Item
instance of: scholarly article
title: Confluence results for the pure strong categorical logic CCL. \(\lambda\)- calculi as subsystems of CCL
zbMATH Open document ID: 0707.03012
DOI: 10.1016/0304-3975(89)90105-9
author: Thérèse Hardin
published in: Theoretical Computer Science
publication date: 1989-01-01T00:00:00Z
Mathematics Subject Classification ID: 03B40
Mathematics Subject Classification ID: 68Q42
Mathematics Subject Classification ID: 18D15
Mathematics Subject Classification ID: 03G30
zbMATH DE Number: 4160689
zbMATH Keywords: \(\lambda \) -calculus with surjective pairing
zbMATH Keywords: Categorical Combinatory Logic
zbMATH Keywords: Cartesian Closed Categories
zbMATH Keywords: confluence properties
zbMATH Keywords: rewriting systems
zbMATH Keywords: locally confluent subsystem
MaRDI profile type: Publication
full work available at URL: 0304-3975(89)90105-9
OpenAlex ID: W2095553492
cites work: Q3342534
cites work: Pairing Without Conventional Restraints
cites work: Q5667469
cites work: Q4175528
cites work: Q3785893
cites work: Q5541309
cites work: Q5686017
cites work: Proof of termination of the rewriting system SUBSET on CCL
cites work: Q4722037
cites work: Q3918095
cites work: Q5581665
cites work: Q3727946
cites work: A new implementation technique for applicative languages
cites work: Church-Rosser theorem for a rewriting system on categorical combinators
description: scientific article; zbMATH DE number 4160689