Marek Zaionc

According to our database1, Marek Zaionc authored at least 32 papers between 1985 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2020
Quantitative Study of Fuzzy Logics.
Proceedings of the 29th IEEE International Conference on Fuzzy Systems, 2020

2019
Preface.
Comb. Probab. Comput., 2019

2018
Special issue on Parallel and distributed computing based on the functional programming paradigm.
Concurr. Comput. Pract. Exp., 2018

2017
On the likelihood of normalization in combinatory logic.
J. Log. Comput., 2017

Combinatorics of $$\lambda$$-terms: a natural approach.
J. Log. Comput., 2017

2016
On the likelihood of normalisation in combinatory logic.
CoRR, 2016

Combinatorics of λ-terms: a natural approach.
CoRR, 2016

A Natural Counting of Lambda Terms.
Proceedings of the SOFSEM 2016: Theory and Practice of Computer Science, 2016

2015
Asymptotic Properties of Combinatory Logic.
Proceedings of the Theory and Applications of Models of Computation, 2015

2013
How big is BCI fragment of BCK logic.
J. Log. Comput., 2013

2010
Tautologies over implication with negative literals.
Math. Log. Q., 2010

2009
Some properties of random lambda terms
Log. Methods Comput. Sci., 2009

Counting proofs in propositional logic.
Arch. Math. Log., 2009

2008
Asymptotic Densities in Logic and Type Theory.
Stud Logica, 2008

2007
Intuitionistic vs. Classical Tautologies, Quantitative Comparison.
Proceedings of the Types for Proofs and Programs, International Conference, 2007

Classical and Intuitionistic Logic Are Asymptotically Identical.
Proceedings of the Computer Science Logic, 21st International Workshop, 2007

2006
Probability distribution for simple tautologies.
Theor. Comput. Sci., 2006

2005
On the Asymptotic Density of Tautologies in Logic of Implication and Negation.
Reports Math. Log., 2005

2004
Statistics of Intuitionistic versus Classical Logics.
Stud Logica, 2004

Probabilistic Approach to the Lambda Definability for Fourth Order Types.
Proceedings of the Second Workshop on Computational Logic and Applications, 2004

Preface.
Proceedings of the Second Workshop on Computational Logic and Applications, 2004

2003
Statistics of implicational logic.
Proceedings of the 10th Workshop on Logic, Language, Information and Computation, 2003

2000
Statistical properties of simple types.
Math. Struct. Comput. Sci., 2000

1997
Schwichtenberg-Style Lambda Definability Is Undecidable.
Proceedings of the Typed Lambda Calculi and Applications, 1997

1994
Lambda Representation of Operations Between Fifferent Term Algebras.
Proceedings of the Computer Science Logic, 8th International Workshop, 1994

1991
lambda-Definability on Free Algebras.
Ann. Pure Appl. Log., 1991

1990
A Characterisation of Lambda Definable Tree Operations
Inf. Comput., November, 1990

1989
How to Define Functionals of Free Structures in Typed Lambda Calculus.
Proceedings of the Mathematical Foundations of Computer Science 1989, 1989

1988
Mechanical Procedure for Proof Construction via Closed Terms in Typed \lambda Calculus.
J. Autom. Reason., 1988

On the "lambda"-definable tree operations.
Proceedings of the Algebraic Logic and Universal Algebra in Computer Science, Conference, 1988

1987
Word Operation Definable in the Typed lambda-Calculus.
Theor. Comput. Sci., 1987

1985
The Set of Unifiers in Typed Lambda-Calculus as Regular Expression.
Proceedings of the Rewriting Techniques and Applications, First International Conference, 1985


  Loading...