Completeness results for the equivalence of recursive schemas
type: Item
instance of: scholarly article
title: Completeness results for the equivalence of recursive schemas
zbMATH Open document ID: 0342.68008
DOI: 10.1016/S0022-0000(76)80036-0
author: Jean E. Vuillemin
author: Bruno Courcelle
published in: Journal of Computer and System Sciences
publication date: 1976-01-01T00:00:00Z
Mathematics Subject Classification ID: 68Q45
Mathematics Subject Classification ID: 68N01
Mathematics Subject Classification ID: 03D99
zbMATH DE Number: 3534047
describes a project that uses: LCF
MaRDI profile type: Publication
cites work: Q4062665
cites work: Q5181349
cites work: Q5649409
cites work: Q4772711
cites work: Q4057634
cites work: Q4185781
cites work: Q4168046
cites work: Q4072875
cites work: On formalised computer programs
cites work: Inductive methods for proving properties of programs
cites work: Q4138713
cites work: Q4077434
cites work: Q5674962
cites work: Q4116078
cites work: Parallel program schemata
cites work: LCF considered as a programming language
cites work: Q3853124
cites work: Q5649639
cites work: Q5685626
cites work: Q4092932
full work available at URL: s0022-0000(76)80036-0
OpenAlex ID: W2092765951
description: scientific article; zbMATH DE number 3534047