wizytowka - Instytut Informatyki Analitycznej

Zainteresowania

asymptotic probability in logic, computability theory, computational logic, typed lambda calculus, lambda definability, functional programming.

Publikacje

  • Fuzzy Logics - quantitatively - 2024
    Journal of Applied Non-Classical Logics 34 (2024), 97-132 Zofia Kostrzycka, Marek Zaionc
  • Quantitative Study of Fuzzy Logics - 2020
    2020 Ieee International Conference On Fuzzy Systems (fuzz-ieee) 2020 Ieee International Conference On Fuzzy Systems (fuzz-ieee) (2020), 1-8 Zofia Kostrzycka, Marek Zaionc
  • Preface - 2019
    Combinatorics Probability and Computing 28(4) (2019), 483-484 Marek Zaionc, Neininger Ralph, Hwang, Hsien-Kuei
  • Foreword to the Special Issue on Parallel and Distributed Computing based on The Functional Programming Paradigm - 2018
    Concurrency Computation Practice and Experience (2018), 4 Aleksander Byrski, Kevin Hammond, John Hughes, Wojciech Turek, Marek Zaionc
  • Asymptotic density in logic and computability - 2017
    Proceedings of the Tenth Workshop On Information Theoretic Methods in Science and Engineering, Paris, France, September 11-13, 2017 Publication series B, Report B-2017-3 (Editors: Jacquet Philippe, Leppä-Aho Janne, Roos Teemu (2017), 43 Marek Zaionc
  • Combinatorics of λ-terms: a natural approach - 2017
    Journal of Logic and Computation Volume 27, Issue 8 (2017), 2611–2630 Maciej Bendkowski, Katarzyna Grygiel, Pierre Lescanne, Marek Zaionc
  • On the likelihood of normalisation in combinatory logic - 2017
    Journal of Logic and Computation Volume 27, Issue 7 (2017), 2251–2269 Maciej Bendkowski, Katarzyna Grygiel, Marek Zaionc
  • A natural counting of lambda terms - 2016
    Lecture Notes in Computer Science 9587 (2016), 183-194 Maciej Bendkowski, Katarzyna Grygiel, Pierre Lescanne, Marek Zaionc
  • Asymptotic properties of combinatory logic - 2013
    Lecture Notes in Computer Science 9076 (2013), 62-72 Maciej Bendkowski, Katarzyna Grygiel, Marek Zaionc
  • Asymptotically almost all λ-terms are strongly normalizing - 2013
    Logical Methods in Computer Science 9 (1:02) (2013), 1-30 Rene David, Katarzyna Grygiel, Jakub Kozik, Christophe Raffalli, Guillaume Theyssier, , Marek Zaionc
  • How big is BCI fragment of BCK logic - 2013
    Journal of Logic and Computation 23(3) (2013), 673-691 Katarzyna Grygiel, Paweł Idziak, Marek Zaionc
  • Tautologies over implication with negative literals - 2010
    Mathematical Logic Quarterly 56 (2010), 388-396 Daniele Gardy, Herve Fournier, Antoine Genitrini, Marek Zaionc
  • Counting proofs in propositional logic - 2009
    Archive for Mathematical Logic 48 (2009), 185-199 Rene David, Marek Zaionc
  • Asymptotic densities in logic and type theory - 2008
    Studia Logica 88 (2008), 385-403 Zofia Kostrzycka, Marek Zaionc
  • Intuitionistic vs. Classical Tautologies, Quantitative Comparison - 2008
    Lecture Notes in Computer Science 4941 (2008), 100-109 Antoine Genitrini, Jakub Kozik, Marek Zaionc
  • Parametrizability by regular expressions for equations on words - 2007
    Bulletin of the Section of Logic 36 (2007), 79-93 Lidia Badura, Marek Zaionc
  • Classical and intuitionistic logic are asymptotically identical - 2007
    Lecture Notes in Computer Science 4646 (2007), 177-193 Daniele Gardy, Herve Fournier, Antoine Genitrini, Marek Zaionc
  • Probability distribution for simple tautologies - 2006
    Theoretical Computer Science 355 (2006), 243-260 Marek Zaionc
  • On the asymptotic density of tautologies in logic of implication and negation - 2005
    Reports on Mathematical Logic 39 (2005), 67-87 Marek Zaionc
  • Probabilistic approach to the lambda definability for fourth order types - 2005
    Electronic Notes in Theoretical Computer Science (2005), 41-54 Marek Zaionc
  • Statistics of intuitionistic versus classical logics - 2004
    Studia Logica 76 (2004), 307 - 328 Zofia Kostrzycka, Marek Zaionc
  • Asymptotic properties of logics - 2003
    Schedae Informaticae 12 (2003), 129-138 Marek Zaionc
  • On the density of truth in Dummet logic - 2003
    Bulletin of the Section of Logic 32 (2003), 43-55 Zofia Kostrzycka, Marek Zaionc
  • Statistics of implicational logic - 2003
    Electronic Notes in Theoretical Computer Science 84 (2003), 205–216 Marek Zaionc
  • Statistical properties of simple types - 2000
    Mathematical Structures in Computer Science 10 (2000), 575-594 Małgorzata Moczurad, Jerzy Tyszkiewicz, Marek Zaionc
  • Schwichtenberg style lambda definability is undecidable - 1997
    Lecture Notes in Computer Science 1210 (1997), 267-283 Jan Małolepszy, Małgorzata Moczurad, Marek Zaionc
  • Lambda representations of operations between different term algebras - 1995
    Lecture Notes in Computer Science 993 (1995), 91-105 Marek Zaionc
  • Lambda definability on free algebras - 1992
    Annals of Pure and Applied Logic 51 (1992), 279-300 Marek Zaionc
  • A Characterization of Lambda Definable Tree Operations - 1990
    Information and Computation 89 (1990), 35-46 Marek Zaionc
  • On the lambda definable higher-order boolean functionals - 1989
    Fundamenta Informaticae 12 (1989), 181-190 Marek Zaionc
  • How To Define Functionals on Free Structures in Typed lambda Calculus - 1989
    Lecture Notes in Computer Science 379 (1989), 566-576 Marek Zaionc
  • Mechanical Procedure for Proof Construction via Closed Terms in Typed lambda Calculus - 1988
    Journal of Automated Reasoning 4 (1988), 173-190 Marek Zaionc
  • On the lambda definable tree operations - 1988
    Lecture Notes in Computer Science 425 (1988), 279-292 Marek Zaionc
  • Word Operations Definable in the Typed lambda Calculus - 1987
    Theoretical Computer Science 52 (1987), 1-14 Marek Zaionc
  • The Regular Expression Descriptions of Unifier Sets in the Typed lambda Calculus - 1987
    Fundamenta Informaticae 10 (1987), 309-322 Marek Zaionc
  • Nondeterministic Programs Definable in Typed Lambda Calculus - 1985
    Fundamenta Informaticae 8 (1985), 63-72 Marek Zaionc
  • The set of Unifiers in Typed lambda calculus as Regular Expression - 1985
    Lecture Notes in Computer Science 202 (1985), 430-440 Marek Zaionc
  • A computer model of evolution and ecological processes - 1984
    Modeling, Simulation & Control C (1984), 59-63 Marian Mrozek, Marek Zaionc

Granty

  • Ilościowe badania teorii mnogości. Czy ZF i ZFC są asymptotycznie równoważne?
    NCN
    Rola: Kierownik
    2019-07-04 - 2023-04-03
  • Asymptotyczne metody w rachunku lambda i logice kombinatorycznej
    NCN
    Rola: Kierownik
    2014-07-16 - 2017-07-15
  • Kolonoskopia -Innowacyjna diagnostyka umożliwiająca personalizacje procesu leczenia poprzez opracowanie rozwiązania wspomagające badania kolonoskopowe, podnoszącego wykrywalność stanów przedrakowych nowotworów jelita grubego o niskim stadium zaawansowania
    NCBiR
    Rola: Kierownik
    2014-07-01 - 2017-12-31
  • Śledzenie poruszających się osób w monitorowanych strefach
    Narodowe Centrum Badań i Rozwoju
    Rola: Wykonawca
    2010-09-17 - 2013-09-16
  • Badanie ilościowe w logikach i teorii obliczeń

    Rola: Kierownik
    2009-09-17 - 2012-03-16

Doktoranci

avatar for Marek Zaionc

Marek Zaionc

stopień/tytuł profesor doktor habilitowany stanowisko
dydaktyczne, profesor
jednostka
  • Katedra Podstaw Informatyki
  • Instytut Informatyki Analitycznej
ORCID kontakt
marek.zaionc@uj.edu.pl
www