Follow
Marek Zaionc
Marek Zaionc
Theoretical Computer Science, Faculty of Mathematics and Computer Science, Jagiellonian University
Verified email at tcs.uj.edu.pl - Homepage
Title
Cited by
Cited by
Year
Statistical properties of simple types
M Moczurad, J Tyszkiewicz, M Zaionc
Mathematical Structures in Computer Science 10 (5), 575-594, 2000
572000
Asymptotically almost all\lambda-terms are strongly normalizing
M Zaionc, G Theyssier, C Raffalli, J Kozic, K Grygiel, R David
Logical Methods in Computer Science 9, 2013
532013
Classical and intuitionistic logic are asymptotically identical
H Fournier, D Gardy, A Genitrini, M Zaionc
International Workshop on Computer Science Logic, 177-193, 2007
392007
Statistics of intuitionistic versus classical logics
Z Kostrzycka, M Zaionc
Studia Logica 76 (3), 307-328, 2004
392004
On the Asymptotic Density of Tautologies in Logic of Implication and Negation.
M Zaionc
Reports Math. Log. 39, 67-87, 2005
352005
Word operation definable in the typed λ-calculus
M Zaionc
Theoretical computer science 52 (1-2), 1-14, 1987
341987
Intuitionistic vs. classical tautologies, quantitative comparison
A Genitrini, J Kozik, M Zaionc
International Workshop on Types for Proofs and Programs, 100-109, 2007
292007
A natural counting of lambda terms
M Bendkowski, K Grygiel, P Lescanne, M Zaionc
International Conference on Current Trends in Theory and Practice of …, 2016
272016
How big is BCI fragment of BCK logic
K Grygiel, PM Idziak, M Zaionc
Journal of Logic and Computation 23 (3), 673-691, 2013
222013
The set of unifiers in typed λ-calculus as regular expression
M Zaionc
International Conference on Rewriting Techniques and Applications, 430-440, 1985
211985
Probability distribution for simple tautologies
M Zaionc
Theoretical Computer Science 355 (2), 243-260, 2006
192006
Combinatorics of -terms: a natural approach
M Bendkowski, K Grygiel, P Lescanne, M Zaionc
Journal of Logic and Computation 27 (8), 2611-2630, 2017
182017
Some properties of random lambda terms
R David, C Raffalli, G Theyssier, K Grygiel, J Kozik, M Zaionc
Logical Methods in Computer Science 9 (1), 2009
172009
λ-definability on free algebras
M Zaionc
Annals of Pure and Applied Logic 51 (3), 279-300, 1991
151991
Mechanical procedure for proof construction via closed terms in typed λ calculus
M Zaionc
Journal of Automated Reasoning 4 (2), 173-190, 1988
151988
On the likelihood of normalization in combinatory logic
M Bendkowski, K Grygiel, M Zaionc
Journal of Logic and Computation 27 (7), 2251-2269, 2017
112017
Asymptotic densities in logic and type theory
Z Kostrzycka, M Zaionc
Studia Logica 88 (3), 385-403, 2008
112008
A characterization of lambda definable tree operations
M Zaionc
Information and Computation 89 (1), 35-46, 1990
91990
The Regular Expression Descriptions of Unifier Set in the Typed λ-Calculus
M Zaionc
Fundamenta Informaticae 10 (3), 309-322, 1987
91987
Tautologies over implication with negative literals
H Fournier, D Gardy, A Genitrini, M Zaionc
Mathematical Logic Quarterly 56 (4), 388-396, 2010
82010
The system can't perform the operation now. Try again later.
Articles 1–20