Project title: Quantitative properties for higher-order recursion schemes
Principal Investigator: Paweł Parys
Project description: The project concerns higher-order recursion schemes, that form a generalization of context-free grammars, where we allow nonterminals to take arguments. Within the project we want to develop mathematical tools allowing estimation of some quantities in trees generated by recursion schemes. The area of the project is closely related to automata theory, lambda calculus, and automatized analysis (verification) of computer programs.
The candidate should conduct scientific research on topics related to the subject of the grant "Quantitative properties for higher-order recursion schemes", that is, to automata theory, lambda calculus, automatized analysis (verification) of computer programs. It is mainly a theoretical research (proving theorems, etc.), but there is also a possibility of implementation of algorithms related to this area.
- Ph.D. in mathematics.
- The candidate was employed in a Ukrainian university before the war started.
- The candidate left (or is about to leave) Ukraine after Feb. 24th, 2022.
- Field of interest related to the research area of the project.
Monthly salaries are comparable with typical Polish academic standards; for more information please do consult the PI.