-
1دورية أكاديمية
المؤلفون: Paweł Parys
المصدر: Discrete Mathematics & Theoretical Computer Science, Vol vol. 22 no. 4, Iss Automata, Logic and Semantics (2020)
مصطلحات موضوعية: simultaneous-unboundedness problem, higher-order recursion schemes, intersection types, reflection, [info.info-fl]computer science [cs]/formal languages and automata theory [cs.fl], [info.info-lo]computer science [cs]/logic in computer science [cs.lo], [info.info-cc]computer science [cs]/computational complexity [cs.cc], Mathematics, QA1-939
وصف الملف: electronic resource
-
2
المؤلفون: Parys, Paweł
المساهمون: Faculty of Mathematics, Informatics, and Mechanics [Warsaw] (MIMUW), University of Warsaw (UW)
المصدر: National Information Processing Institute
Discrete Mathematics and Theoretical Computer Science
Discrete Mathematics and Theoretical Computer Science, DMTCS, 2020, vol. 22 no. 4مصطلحات موضوعية: [INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC], TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES, [INFO.INFO-FL]Computer Science [cs]/Formal Languages and Automata Theory [cs.FL], Computer Science::Logic in Computer Science, simultaneous-unboundedness problem, intersection types, ComputingMilieux_COMPUTERSANDSOCIETY, [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO], Nonlinear Sciences::Cellular Automata and Lattice Gases, Computer Science::Formal Languages and Automata Theory, higher-order recursion schemes, reflection
وصف الملف: application/pdf
-
3دورية أكاديمية
لا يتم عرض هذه النتيجة على الضيوف.
تسجيل الدخول للوصول الكامل.