Efficient program synthesis: semantics, logic, complexity

DOI10.1007/3-540-54415-1_67MaRDI QIDQ5096241zbMATH OpenOpenAlexFDO

Authors Max Kanovich

Publication date 16 August 2022

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-54415-1_67

Mathematics Subject Classification ID

Logic in computer science (03B70) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Analysis of algorithms and problem complexity (68Q25) Semantics in the theory of computing (68Q55)

Recommendations

• scientific article; zbMATH DE number 4049027
• Synthesis of functional programs with help of first-order intuitionistic logic
• Efficient program synthesis in computational models
• scientific article; zbMATH DE number 792049
• scientific article; zbMATH DE number 4020482

Cites work

• Efficient program synthesis in computational models
• scientific article; zbMATH DE number 3648167 (Why is no real title available?)
• scientific article; zbMATH DE number 4023248 (Why is no real title available?)
• scientific article; zbMATH DE number 3511563 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 3291134 (Why is no real title available?)

Cited in

(8)

• Linear logic as a logic of computations
• The complexity of Horn fragments of linear logic
• On the complexity of formulas in semantic programming
• Grigori Mints and computer science
• scientific article; zbMATH DE number 4203709 (Why is no real title available?)
• Efficient program synthesis in computational models
• Semantics-to-Syntax Analyses of Algorithms
• Synthesis of functional programs with help of first-order intuitionistic logic

This page was built for publication: Efficient program synthesis: semantics, logic, complexity

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