scientific article; zbMATH DE number 4037166

MaRDI QIDQ3776599zbMATH OpenFDO

Authors D. I. Sviridenko, Yuri L. Ershov, S. S. Goncharov

Publication date 1986

zbMATH Keywords

\(\Sigma \)-formulaecomputable predicates of finite typeslist extensionssemantic programming

Mathematics Subject Classification ID

Logic in computer science (03B70) General topics in the theory of software (68N01) Specification and verification (program logics, model checking, etc.) (68Q60)

Cited in

(14)

• Insertion programming
• Recursive terms in semantic programming
• A class of almost \(c\)-simple rings
• scientific article; zbMATH DE number 3890767 (Why is no real title available?)
• Programming Denotational Semantics II
• Executable semantic descriptions
• scientific article; zbMATH DE number 3980456 (Why is no real title available?)
• scientific article; zbMATH DE number 4021108 (Why is no real title available?)
• scientific article; zbMATH DE number 4047058 (Why is no real title available?)
• scientific article; zbMATH DE number 4049008 (Why is no real title available?)
• Semantic code browsing
• Universal functions and almost \(c\)-simple models
• Semantic programming and polynomially computable representations
• Programming language semantics: It’s easy as 1,2,3

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 Q3776599)