| 2009 |
|---|
| 20 | EE | René David,
Christophe Raffalli,
Guillaume Theyssier,
Katarzyna Grygiel,
Jakub Kozik,
Marek Zaionc:
Some properties of random lambda terms
CoRR abs/0903.5505: (2009) |
| 2008 |
|---|
| 19 | EE | Zofia Kostrzycka,
Marek Zaionc:
Asymptotic Densities in Logic and Type Theory.
Studia Logica 88(3): 385-403 (2008) |
| 2007 |
|---|
| 18 | EE | Hervé Fournier,
Danièle Gardy,
Antoine Genitrini,
Marek Zaionc:
Classical and Intuitionistic Logic Are Asymptotically Identical.
CSL 2007: 177-193 |
| 17 | EE | Antoine Genitrini,
Jakub Kozik,
Marek Zaionc:
Intuitionistic vs. Classical Tautologies, Quantitative Comparison.
TYPES 2007: 100-109 |
| 2006 |
|---|
| 16 | EE | Marek Zaionc:
Probability distribution for simple tautologies.
Theor. Comput. Sci. 355(2): 243-260 (2006) |
| 2005 |
|---|
| 15 | EE | Pierre Lescanne,
René David,
Marek Zaionc:
Preface.
Electr. Notes Theor. Comput. Sci. 140: 1 (2005) |
| 14 | EE | Marek Zaionc:
Probabilistic Approach to the Lambda Definability for Fourth Order Types.
Electr. Notes Theor. Comput. Sci. 140: 41-54 (2005) |
| 13 | EE | Marek Zaionc:
On the Asymptotic Density of Tautologies in Logic of Implication and Negation.
Reports on Mathematical Logic 39: 67-87 (2005) |
| 2004 |
|---|
| 12 | EE | Zofia Kostrzycka,
Marek Zaionc:
Statistics of Intuitionistic versus Classical Logics.
Studia Logica 76(3): 307-328 (2004) |
| 2003 |
|---|
| 11 | EE | Marek Zaionc:
Statistics of implicational logic.
Electr. Notes Theor. Comput. Sci. 84: (2003) |
| 2000 |
|---|
| 10 | | Malgorzata Moczurad,
Jerzy Tyszkiewicz,
Marek Zaionc:
Statistical properties of simple types.
Mathematical Structures in Computer Science 10(5): 575-594 (2000) |
| 1997 |
|---|
| 9 | | Jan Malolepszy,
Malgorzata Moczurad,
Marek Zaionc:
Schwichtenberg-Style Lambda Definability Is Undecidable.
TLCA 1997: 267-283 |
| 1994 |
|---|
| 8 | | Marek Zaionc:
Lambda Representation of Operations Between Fifferent Term Algebras.
CSL 1994: 91-105 |
| 1991 |
|---|
| 7 | | Marek Zaionc:
lambda-Definability on Free Algebras.
Ann. Pure Appl. Logic 51(3): 279-300 (1991) |
| 1990 |
|---|
| 6 | | Marek Zaionc:
A Characterisation of Lambda Definable Tree Operations
Inf. Comput. 89(1): 35-46 (1990) |
| 1989 |
|---|
| 5 | | Marek Zaionc:
How to Define Functionals of Free Structures in Typed Lambda Calculus.
MFCS 1989: 566-576 |
| 1988 |
|---|
| 4 | | Marek Zaionc:
On the "lambda"-definable tree operations.
Algebraic Logic and Universal Algebra in Computer Science 1988: 279-292 |
| 3 | | Marek Zaionc:
Mechanical Procedure for Proof Construction via Closed Terms in Typed \lambda Calculus.
J. Autom. Reasoning 4(2): 173-190 (1988) |
| 1987 |
|---|
| 2 | | Marek Zaionc:
Word Operation Definable in the Typed lambda-Calculus.
Theor. Comput. Sci. 52: 1-14 (1987) |
| 1985 |
|---|
| 1 | | Marek Zaionc:
The Set of Unifiers in Typed Lambda-Calculus as Regular Expression.
RTA 1985: 430-440 |
