| Automata theory approach to predicate intuitionistic logic | 0 | 0.34 | 2022 |
| On the complexity of computation maximal exponent of periodicity of word equations and expressible relations (note) | 0 | 0.34 | 2019 |
| First-order answer set programming as constructive proof search. | 0 | 0.34 | 2018 |
| Formalisation of a frame stack semantics for a Java-like language. | 0 | 0.34 | 2018 |
| How Hard Is Positive Quantification? | 0 | 0.34 | 2016 |
| Coq Support in HAHA. | 0 | 0.34 | 2016 |
| ON THE MINTS HIERARCHY IN FIRST-ORDER INTUITIONISTIC LOGIC | 0 | 0.34 | 2016 |
| Invited talk: On Differences in Proofs Between Intuitionistic and Classical Logic. | 0 | 0.34 | 2016 |
| Automata Theory Approach to Predicate Intuitionistic Logic. | 1 | 0.35 | 2016 |
| Synthesis of Functional Programs with Help of First-Order Intuitionistic Logic. | 0 | 0.34 | 2016 |
| The impact of proof steps sequence on proof readability - experimental setting. | 0 | 0.34 | 2016 |
| On the Mints Hierarchy in First-Order Intuitionistic Logic. | 2 | 0.41 | 2015 |
| Lucretia - Intersection Type Polymorphism For Scripting Languages | 0 | 0.34 | 2015 |
| Automata Theoretic Account of Proof Search. | 1 | 0.37 | 2015 |
| Java Loops Are Mainly Polynomial. | 0 | 0.34 | 2015 |
| Protocol State Machines and Session Languages: Specification, implementation, and Security Flaws | 4 | 0.53 | 2015 |
| On multiply-exponential write-once Turing machines. | 0 | 0.34 | 2014 |
| A note on subject reduction in (→,∃)-Curry with respect to complete developments | 0 | 0.34 | 2014 |
| Tool Support for Teaching Hoare Logic. | 0 | 0.34 | 2014 |
| Existential type systems between Church and Curry style (type-free style). | 0 | 0.34 | 2014 |
| Restricted Positive Quantification Is Not Elementary. | 1 | 0.39 | 2014 |
| Decidable structures between Church-style and Curry-style. | 0 | 0.34 | 2013 |
| Testing of Evolving Protocols | 0 | 0.34 | 2012 |
| ML with PTIME complexity guarantees. | 1 | 0.36 | 2012 |
| Lucretia - a type system for objects in languages with reflection | 0 | 0.34 | 2012 |
| The undecidability of type related problems in the type-free style System F with finitely stratified polymorphic types | 1 | 0.36 | 2012 |
| The role of polymorphism in the characterisation of complexity by soft types | 0 | 0.34 | 2011 |
| A Dozen Instructions Make Java Bytecode | 0 | 0.34 | 2011 |
| The Undecidability of Type Related Problems in Type-free Style System F | 2 | 0.38 | 2010 |
| Relational Abstract Domain of Weighted Hexagons | 7 | 0.47 | 2010 |
| The Existential Fragment of the One-Step Parallel Rewriting Theory | 0 | 0.34 | 2009 |
| Existential Type Systems with No Types in Terms | 7 | 0.53 | 2009 |
| The Non-Interference Protection in BML | 0 | 0.34 | 2009 |
| BML and Related Tools | 1 | 0.39 | 2008 |
| On the building of affine retractions | 1 | 0.38 | 2008 |
| Extending operational semantics of the Java bytecode | 2 | 0.36 | 2007 |
| Minik: A Tool for Maintaining Proper Java Code Structure | 0 | 0.34 | 2006 |
| ESC/Java2 as a Tool to Ensure Security in the Source Code of Java Applications | 1 | 0.35 | 2006 |
| A self-dependency constraint in the simply typed lambda calculus | 1 | 0.36 | 2005 |
| The Complexity of beta-Reduction in Low Orders | 2 | 0.49 | 2001 |
| Type Inference for First-Order Logic | 0 | 0.34 | 2000 |
| Partially Typed Terms between Church-Style and Curry-Style | 9 | 0.57 | 2000 |
| Second-order unification and type inference for Church-style polymorphism | 21 | 1.04 | 1998 |
| Linear Interpolation for the Higher-Order Matching Problem | 15 | 1.44 | 1997 |
