Instytut Informatyki
Menu
badania

Publikacje

  • Publikacje Zakładu Języków Programowania w roku 2019

    1. M. Biernacka, W. Charatonik, Deriving an abstract machine for strong call by need, W: 4th International Conference on Formal Structures for Computation and Deduction (FSCD 2019) / Herman Geuvers (ed.). - Wadern : Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. - s. 8:1-8:20. (http://doi.org/10.4230/LIPIcs.FSCD.2019.8).
    2. D. Biernacki, S. Lenglet, P. Polesiuk, A Complete Normal-Form Bisimilarity for State, W: Foundations of software science and computation structures : 22nd international conference FOSSACS 2019, held as part of the European joint conferences on theory and practice of software, ETAPS 2019, Prague, Czech Republic, April 6-11, 2019 : proceedings / edited by Mikołaj Bojańczyk, Alex Simpson. - Cham : Springer, 2019. - (Lecture Notes in Computer Science ; vol. 11425). - s. 98-114. - (http://dx.doi.org/10.1007/978-3-030-17127-8_6).
    3. D. Biernacki, S. Lenglet, P. Polesiuk, Bisimulations for Delimited-Control operators, W: Logical Methods in Computer Science. - Vol. 15, iss. 2 (2019), s. 18:1-18:57. - (https://doi.org/10.23638/LMCS-15(2:18)2019).
    4. D. Biernacki, S. Lenglet, P. Polesiuk, Diacritical companions, W: Electronic Notes in Theoretical Computer Science. - Vol. 347 (2019), s. 25-43. - (https://doi.org/10.1016/j.entcs.2019.09.003).
    5. D. Biernacki, S. Lenglet, P. Polesiuk, Proving soundness of extensional normal-form bisimilarities, W: Logical Methods in Computer Science. - Vol. 15, iss. 1 (2019), s. 31:1-31:24. - (https://doi.org/10.23638/LMCS-15(1:31)2019).
    6. D. Biernacki, M. Piróg, P. Polesiuk, F. Sieczkowski, Abstracting algebraic effects, W: Proceedings of the ACM on Programming Languages. - Vol. 3, iss. POPL (2019), nr art. 6, s. 1-28. - (https://doi.org/10.1145/3290319).
    7. T. J. Drab, Informatyka oparta na rachunkach, W: Informatyka w edukacji : edukacja informatyczna a rozwój sztucznej inteligencji / redakcja Anna Beata Kwiatkowska, Maciej M. Sysło. - Toruń : Wydawnictwo Naukowe Uniwersytetu Mikołaja Kopernika, 2019. - s. 168-178. - (https://iwe.mat.umk.pl/tom-iwe2019/19.pdf).
    8. T. J. Drab, Rachunek lambda dla początkujących, W: Informatyka w edukacji : edukacja informatyczna a rozwój sztucznej inteligencji / redakcja Anna Beata Kwiatkowska, Maciej M. Sysło. - Toruń : Wydawnictwo Naukowe Uniwersytetu Mikołaja Kopernika, 2019. - s. 249-259. - (https://iwe.mat.umk.pl/tom-iwe2019/19.pdf).
    9. S. Goncharov, L. Schröder, C. Rauch, M. Piróg, Guarded and unguarded iteration for generalized processes, W: Logical Methods in Computer Science. - Vol. 15, iss. 3 (2019), s. 1:1-1:47. - (https://doi.org/10.23638/LMCS-15(3:1)2019).
    10. M. Piróg, P. Polesiuk, F. Sieczkowski, Equational theories and monads from polynomial Cayley representations, W: Foundations of software science and computation structures : 22nd international conference FOSSACS 2019, held as part of the European joint conferences on theory and practice of software, ETAPS 2019, Prague, Czech Republic, April 6-11, 2019 : proceedings / edited by Mikołaj Bojańczyk, Alex Simpson. - Cham : Springer, 2019. - (Lecture Notes in Computer Science ; vol. 11425). - s. 453-469. - (http://dx.doi.org/10.1007/978-3-030-17127-8_26).
    11. M. Piróg, P. Polesiuk, F. Sieczkowski, Typed equivalence of effect handlers and delimited control, W: 4th International Conference on Formal Structures for Computation and Deduction (FSCD 2019) / Herman Geuvers (ed.). - Wadern : Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. - s. 30:1-30:16. - (http://doi.org/10.4230/LIPIcs.FSCD.2019.30).
    12. T. Schrijvers, M. Piróg, N. Wu, M. Jaskelioff, Monad transformers and modular algebraic effects: what binds them together, W: Haskell 2019 - Proceedings of the 12th ACM SIGPLAN International Symposium on Haskell, co-located with ICFP 2019 / Richard A. Eisenberg (ed.). - New York : Association for Computing Machinery (ACM), 2019. - s. 98-113. - (https://doi.org/10.1145/3331545.3342595).

  • Publikacje Zakładu Języków Programowania w roku 2018

    1. B. Bednarczyk, W. Charatonik, Modulo counting on words and trees, W: 37th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2017) / Satya Lokam and R. Ramanujam (eds.). - Wadern : Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018. - (LIPIcs - Leibniz International Proceedings in Informatics ; 93).- S. 12-1-12-16 (https://doi.org/10.4230/LIPIcs.FSTTCS.2017.12).
    2. D. Biernacki, S. Lenglet, P. Polesiuk, Proving soundness of extensional normal : form bisimilarities, W: Electronic Notes in Theoretical Computer Science. - Vol. 336 (2018), s. 41-56 (https://doi.org/10.1016/j.entcs.2018.03.015).
    3. D. Biernacki, M. Piróg, P. Polesiuk, F. Sieczkowski, Handle with care : relational interpretation of algebraic effects and handlers, W: Proceedings of the ACM on Programming Languages. - Vol. 2, Iss. POPL (2018), s. 8-1-8-30 (https://doi.org/10.1145/3158096).
    4. D. Biernacki, P. Polesiuk, Logical relations for coherence of effect subtyping, W: Logical Methods in Computer Science. - Vol. 14, iss. 1 (2018), s. 1-28 (https://doi.org/10.23638/LMCS-14(1:11)2018).
    5. W. Charatonik, Y. Guskov, I. Pratt-Hartmann, P. Witkowski, Two-variable first-order logic with counting in forests, W: LPAR-22. 22nd International Conference on Logic for Programming, Artificial Intelligence and Reasoning / Editors Gilles Barthe, Geoff Sutcliffe, Margus Veanes. - [Manchester] : EasyChair Publications, 2018. - (EPiC Series in Computing ; 57). - S. 214-232 (https://doi.org/10.29007/24fm).
    6. J. Michaliszyn, J. Otop, P. Witkowski, Satisfiability versus finite satisfiability in elementary modal logics, W: Fundamenta Informaticae. - Vol. 163, iss. 2 (2018), s. 165-188 (https://doi.org/10.3233/FI-2018-1736).
    7. M. Piróg, T. Schrijvers, N. Wu, M. Jaskelioff, Syntax and semantics for operations with scopes, W: Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science - LICS '18. - New York : ACM, 2018. - S. 809-818 (https://doi.org/10.1145/3209108.3209166).
    8. P. Wieczorek, D. Biernacki, A Coq formalization of normalization by evaluation for Martin-Löf type theory, W: Proceedings of the 7th ACM SIGPLAN International Conference on Certified Programs and Proofs - CPP 2018 / June Andronick, Amy Felty (eds.). - New York : ACM, 2018.- S. 266-279 (https://doi.org/10.1145/3167091).

  • Publikacje Zakładu Języków Programowania w roku 2017

    1. A. Aristizábal, D. Biernacki, S. Lenglet, P. Polesiuk, Environmental Bisimulations for Delimited-Control Operators with Dynamic Prompt Generation. LMCS 13 (3:27), 2017, pp. 1–26. (doi:10.23638/LMCS-13(3:27)2017)
    2. B. Bednarczyk, W. Charatonik, Modulo Counting on Words and Trees. FSTTCS 2017, Kanpur, December 2017. To appear
    3. B. Bednarczyk, W. Charatonik, E. Kieroński, Extending Two-Variable Logic on Trees. CSL 2017, Stockholm, Sweden, August 2017, pp. 11:1–20. (doi:10.4230/LIPIcs.CSL.2017.11)
    4. M. Biernacka, D. Biernacki, S. Lenglet, P. Polesiuk, D. Pous and A. Schmitt, Fully abstract encodings of λ-calculus in HOcore through abstract machines. LICS 2017, Reykjavik, Iceland, 2017, pp. 1-12. (doi:10.1109/LICS.2017.8005118)
    5. M. Biernacka, W. Charatonik, K. Zielińska, Generalized Refocusing: From Hybrid Strategies to Abstract Machines. FSCD 2017, Oxford, UK, September 2017, pp. 10:1–17. doi:10.4230/LIPIcs.FSCD.2017.10
    6. D. Biernacki, S. Lenglet, P. Polesiuk, Proving Soundness of Extensional Normal-Form Bisimilarities. MFPS XXXIII, Ljubljana, Slovenia, June 2017, pp. 1–15. (http://coalg.org/mfps-calco2017/mfps-papers/5-biernacki.pdf)
    7. S. Goncharov, L. Schröder, C. Rauch, M. Piróg, Unifying guarded and unguarded iteration. FoSSaCS 2017, Uppsala, Sweden, April 2017, pp. 517–533. (doi:10.1007/978-3-662-54458-7_30)
    8. M. Piróg, S, Staton, Backtracking with Cut via a Distributive Law and Left-Zero Monoids. Journal of Functional Programming 27, July 2017. (doi:10.1017/S0956796817000077)
    9. H. de Nivelle, Theorem proving for classical logic with partial functions by reduction to Kleene logic, Journal of Logic and Computation. - Vol. 27, iss. 2 (2017), s. 509-548. (http://dx.doi.org/10.1093/logcom/exu071)

  • Publikacje Zakładu Języków Programowania w roku 2016

    1. A. Aristizábal, D. Biernacki, S. Lenglet, P. Polesiuk, Environmental Bisimulations for Delimited-Control Operators with Dynamic Prompt Generation. FSCD 2016, pp. 9:1–17. doi:10.4230/LIPIcs.FSCD.2016.9
    2. W. Charatonik, P. Witkowski, Two-variable Logic with Counting and a Linear Order. Logical Methods in Computer Science 12(2) (2016), pp. 1–31. https://arxiv.org/abs/1604.06038
    3. H. de Nivelle, Subsumption Algorithms for Three-Valued Geometric Resolution. IJCAR 2016, pp. 257–272. doi:10.1007/978-3-319-40229-1_18
    4. W. Charatonik, P. Witkowski, Two-Variable Logic with Counting and Trees. ACM Trans. Comput. Logic 17(4), November 2016, pp. 31:1–27. doi:10.1145/2983622

  • Publikacje Zakładu Języków Programowania w roku 2015

    1. W. Charatonik, P. Witkowski, Two-variable logic with counting and a linear order, 24th EACSL Annual Conference on Computer Science Logic (CSL 2015) / Stephan Kreutzer (ed.). - Wadern : Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2015. - (LIPIcs - Leibniz International Proceedings in Informatics ; 41).- S. 631-647. (http://dx.doi.org/10.4230/LIPIcs.CSL.2015.631).
    2. M. Materzok, Easyprove: a tool for teaching precise reasoning, Proceedings of the Fourth International Conference on Tools for Teaching Logic 9-12 June 2015 / (eds.) M. Antonia Huertas et al. - Rennes : Université de Rennes, 2015.- S. 129-136. (http://ttl2015.irisa.fr/TTL2015_proceedings.pdf).
    3. D. Biernacki, O. Danvy, K. Millikin, A dynamic continuation-passing style for dynamic delimited continuations, ACM Transactions on Programming Languages and Systems . - Vol.38, iss. 1 (2015), nr art. 2. (http://dx.doi.org/10.1145/2794078).
    4. D. Biernacki, P. Polesiuk, Logical relations for coherence of effect subtyping, 13th International Conference on Typed Lambda Calculi and Applications (TLCA 2015)/ Thorsten Altenkirch (ed.). - Wadern : Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2015. - (LIPIcs - Leibniz International Proceedings in Informatics ; 38).- S. 107-122. (http://dx.doi.org/10.4230/LIPIcs.TLCA.2015.107).
    5. J. de Nivelle, Automated Reasoning with Analytic Tableaux and Related Methods, 24th International Conference, TABLEAUX 2015, Wroclaw, Poland, September 21-24, 2015, Proceedings / red. Hans de Nivelle Cham : Springer International Publishing, 2015. (http://dx.doi.org/10.1007/978-3-319-24312-2).

  • Publikacje Zakładu Języków Programowania w roku 2014

    1. W. Charatonik, E. Kieroński, F. Mazowiecki, Decidability of Weak Logics with Deterministic Transitive Closure, CSL-LICS 2014. Vienna, Austria, July 14 - 18, 2014. Proceedings, pp. 29:1--29:10. (http://dl.acm.org/citation.cfm?doid=2603088.2603134).
    2. D. Biernacki, S. Lenglet, Applicative Bisimilarities for Call-by-Name and Call-by-Value Lambda-Mu-Calculus, In Bart Jacobs, Alexandra Silva, and Sam Staton, editors, Proceedings of the 30th Conference on the Mathematical Foundations of Programming Semantics (MFPS XXX), pp. 49-64, Ithaca, NY, June 2014. ENTCS 308, 2014. Elsevier. (http://www.sciencedirect.com/science/article/pii/S1571066114000711).
    3. J. de Nivelle, Theorem Proving for Logic with Partial Functions Using Kleene Logic and Geometric Logic, workshop Automated Reasoning in Quantified Non-Classical Logics (ARQNL) 2014, edited by Christoph Benzmüller and Jens Otten, pages 71-85, published by VSL Workshop Proceedings.
    4. J. de Nivelle, Theorem Proving for Classical Logic with Partial Functions by Reduction to Kleene Logic, Journal of Logic and Computation, Oxford University Press, 2014.

  • Publikacje Zakładu Języków Programowania w roku 2013

    1. M. Biernacka, D. Biernacki, W. Jedynak, An operational foundation for the tactic language of Coq, Proceedings of the 15th Symposium on Principles and Practice of Declarative Programming : Madrid, Spain, September 16-18, 2013. - New York : ACM , 2013.- S. 25-36. (http://dx.doi.org/10.1145/2505879.2505890).
    2. W. Charatonik, E. Kieroński, S. Benaim, M. Benedikt, R. Lenhardt, F. Mazowiecki, J. Worrell, Complexity of two-variable logic on finite trees, Automata, languages, and programming : 40th International Colloquium, ICALP 2013, Riga, Latvia, July 8 - 12, 2013, Part II / Fedor V. Fomin, Rusinš Freivalds, Marta Kwiatkowska, David Peleg (eds.). - Berlin, Heidelberg : Springer, 2013. - (Lecture Notes in Computer Science ; Vol. 7966). - S. 74-88. (http://dx.doi.org/10.1007/978-3-642-39212-2_10).
    3. W. Charatonik, P. Witkowski, Two-variable logic with counting and trees, 28th Annual IEEE/ACM Symposium on Logic in Computer Science (LICS), 2013 : 25 - 28 June 2013, New Orleans, Louisiana. - Piscataway : IEEE Computer Society, 2013. - S. 73-82. (http://doi.ieeecomputersociety.org/10.1109/LICS.2013.12).
    4. M. Materzok, Axiomatizing subtyped delimited continuations, Computer Science Logic 2013 (CSL 2013) / Simona Ronchi Della Rocca (ed.). - Wadern : Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2013. - (LIPIcs - Leibniz International Proceedings in Informatics ; Vol.23).- S. 521-539. (http://dx.doi.org/10.4230/LIPIcs.CSL.2013.521).
    5. M. Biernacka, D. Biernacki, S. Lenglet, M. Materzok, Proving termination of evaluation for System F with control operators, Electronic Proceedings in Theoretical Computer Science. - Vol. 127 (2013), s. 15-29. (http://dx.doi.org/10.4204/EPTCS.127.2).
    6. A. Barecka, W. Charatonik, Parameterized complexity of basic decision problems for tree automata, International Journal of Computer Mathematics. - Vol. 90, iss. 6 (2013), s. 1150-1170. (http://dx.doi.org/10.1080/00207160.2012.762451).
    7. D. Biernacki, S. Lenglet, Environmental Bisimulations for Delimited-Control Operators, Proceedings of the 11th Asian Symposium on Programming Languages and Systems (APLAS 2013), pp., Melbourne, Australia, Springer, 2013. - (Lecture Notes in Computer Science ; Vol. 8301). - S. 333-348. (http://dx.doi.org/ 10.1007/978-3-319-03542-0_24).

  • Publikacje Zakładu Języków Programowania w roku 2012

    1. J. Otop, E-unification with Constants vs. General E-unification, Journal of Automated Reasoning, Vol. 48 No. 3 (2012), 363-390. (http://dx.doi.org/10.1007/s10817-010-9201-2).
    2. D. Biernacki, S. Lenglet, Applicative bisimulations for delimited-control operators, Foundations of software science and computational structures : 15th international conference FOSSACS 2012, held as part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2012, Tallinn, Estonia, March 24 - April 1, 2012 : proceedings / Lars Birkedal (ed.). - Berlin ; Heidelberg : Springer, 2012. - (Lecture Notes in Computer Science ; 7213).- S. 119-134. (http://dx.doi.org/10.1007/978-3-642-28729-9).
    3. D. Biernacki, M. Materzok, A Dynamie Interpretation of the CPS Hierarchy, R. Jhala and A. Igarashi, editors, Proceedings of the l0th Asian Symposium on Programming Languages and Systems (APLAS 2012), Kyoto, Japan, December 2012. (http://www.ii.uni.wroc. pl/~dabi/publications/APLAS12/materzok-biernacki-aplasl2.pdf).
    4. D. Biernacki, S. Lenglet, Normal Form Bisimulations for Delimited-Control Operators, T. Shrijvers and P. Thiemann, editors, Proceedings of the 11th International Symposium on Functional and Logic Programming (FLOPS 2012), Kobe, Japan, May 2012. (http: //www.ii.uni.wroc.pl/~dabi/publications/FL0PS12/biernacki-lenglet -flopsl2.pdf.).
    5. L. Grocholski, Specyfikowanie wymagań jako bariera wdrażania systemów klasy B2B, Metody Informatyki Stosowanej. - 2011, nr 5 (2012), s. 35-48.
    6. J. Michaliszyn, J. Otop, Decidable elementary modal logics, 27th Annual ACM/IEEE Symposium on Logic in Computer Science, 25-28 June 2012, Dubrovnik, Croatia : proceedings /Rajeev Alur (ed.). - Los Alamitos : IEEE Computer Society, 2012.- S. 491-500. (http://dx.doi.org/10.1109/LICS.2012.59).
    7. E. Kieroński, J. Michaliszyn, Two-variable universal logic with transitive closure, Computer Science Logic (CSL'12) - 26th International Workshop/21st Annual Conference of the EACSL, CSL 2012, September 3-6, 2012, Fontainebleau, France / Patrick Cégielski, Arnaud Durand (eds.). - Wadern : Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2012. - (LIPIcs - Leibniz International Proceedings in Informatics ; Vol.16).- S. 396-410. (http://dx.doi.org/10.4230/LIPIcs.CSL.2012.396).
    8. J. Michaliszyn, J. Otop, P. Witkowski, Satisfiability vs. finite satisfiability in elementary modal logics, Electronic Proceedings in Theoretical Computer Science. - Vol. 96 (2012), s. 141-154. (http://dx.doi.org/10.4204/EPTCS.96.11).
    9. S. Staworko, P. Wieczorek, Learning twig and path queries, EDBT/ICDT 2012 Joint Conference : Electronic Conference Proceedings : March 26-30, 2012, Berlin, Germany / Ismail Ari (ed.). - Berlin : ACM, 2012. (http://www.edbt.org/Proceedings/2012-Berlin/papers/icdt/a20-Staworko.pdf).
    10. E. Kieroński, M. Otto, Small substructures and decidability issues for first-order logic with two variables, Journal of Symbolic Logic. - Vol. 77, iss. 3 (2012), s. 729-765. (http://projecteuclid.org/DPubS?service=UI).
    11. E. Kieroński, J. Michaliszyn, I. Pratt-Hartmann, L. Tendera, Two-variable first-order logic with equivalence closure, Proceedings of the 27th Annual ACM/IEEE Symposium on Logic in Computer Science ; 25-28 June 2012, Dubrovnik, Croatia. - Los Alamitos : IEEE Computer Society, 2012.- S. 431-440. (http://dx.doi.org/10.1109/LICS.2012.53).
    12. E. Kieroński, J. Michaliszyn, Finite Satisfiability of Modal Logic over Horn Definable Classes of Frames, AIML 2012. 27th Annual Symposium on Advances in Modal Logic. Copenhagen, Denmark, August 25-28, 2012. Proceedings, pages 464-482, RK.
    13. S. Staworko, J. Chomicki, J. Marcinkowski, Prioritized repairing and consistent query answering in relational databases, Annals of Mathematics and Artificial Intelligence . 64(2-3): 209-246 (2012), RF.
    14. J. Michaliszyn, P. Wieczorek, A. Muscholl, S. Staworko, Z. Wu, On Injective Embeddings of Tree Patterns, (http://arxiv.org/pdf/1204.4948).
    15. A. Kościelski, Uwagi o indukcji matematycznej, Matematyka. - R. 65, nr 5 (2012), s. 25-31.