scientific article; zbMATH DE number 3942990

MaRDI QIDQ3713561zbMATH OpenFDO

Authors Elias Dahlhaus, Johann A. Makowsky

Publication date 1986

zbMATH Keywords

abstract data typescomplexitycomputational completenessgeneralized recursion theoryhigh level programming language designindependenceprogramming primitivesquery languagesset oriented programming languagesSETL

Mathematics Subject Classification ID

General topics in the theory of software (68N01) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• scientific article; zbMATH DE number 3976287
• scientific article; zbMATH DE number 4090786
• scientific article; zbMATH DE number 4016167
• scientific article; zbMATH DE number 3890767
• ON THE COMPUTING POWER OF PROGRAMS WITH SETS

Cited in

(8)

• Query languages for hierarchic databases
• Hereditarily-finite sets, data bases and polynomial-time computability
• -languages for sets and LOGSPACE computable graph transformers
• Some thoughts on computational models: from massive human computing to abstract state machines, and beyond
• scientific article; zbMATH DE number 3976287 (Why is no real title available?)
• Composition aspects of programmology. I
• scientific article; zbMATH DE number 4090786 (Why is no real title available?)
• My writing

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3713561)