Efficient program synthesis: Semantics, logic, complexity

DOI10.1007/3-540-54415-1_67zbMath1493.68114OpenAlexW2122766910MaRDI QIDQ5096241

Max I. 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

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

Related Items (2)

Linear logic as a logic of computations ⋮ The complexity of Horn fragments of linear logic

Cites Work

• Efficient program synthesis in computational models
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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