Projects funded by the NCN
Quantitative properties for higher-order recursion schemes
2016/22/E/ST6/00041
Keywords:
automata theory quantitative properties higher-order recursion schemes intersection types unbounding quantifier decidability
Descriptors:
- ST6_4: Formal methods, foundations of computer science, including theoretical computer science, quantum algorithms
Panel:
ST6 - Computer science and informatics: informatics and information systems, computer science, scientific computing, intelligent systems
Host institution :
Uniwersytet Warszawski, Wydział Matematyki, Informatyki i Mechaniki
woj. mazowieckie
Principal investigator (from the host institution):
Number of co-investigators in the project: 6
Call: SONATA BIS 6 - announced on 2016-06-15
Amount awarded: 1 102 049 PLN
Project start date (Y-m-d): 2017-04-12
Project end date (Y-m-d): 2023-04-11
Project duration:: 72 months (the same as in the proposal)
Project status: Project settled
Project description
Download the project description in a pdf file
Note - project descriptions were prepared by the authors of the applications themselves and placed in the system in an unchanged form.