phone: +48 12 664 7536, e-mail: mmoczurad at ii A uj B edu C pl (A, B, C := ".")

INFORMACJE DLA STUDENTÓW:



Analiza matematyczna 1a

RESEARCH AND TEACHING INTERESTS:

Typed lambda calculus, lambda definability, distributed local algorithms

PUBLICATIONS AND REPORTS:

1. Lambda-Representability of Integer, Word and Tree Functions, Fundamenta Informaticae 17/3 (1992) pp. 253-270
2. (with Marek Zaionc) Lambda-Representability by Linear Terms of the Type (N -> N)-> N, report of Department of Computer Science, UJ (1996)
3. (with Jan Małolepszy, Marek Zaionc) Schwichtenberg style lambda definability is undecidable. In: TLCA'97, Lectures Notes in Computer Science 1210 (1997) pp. 267-283
4. Syntaktyczne metody dowodzenia własności typowanego rachunku lambda (PhD Thesis)
5. (with Jerzy Tyszkiewicz, Marek Zaionc) Statistical properties of simple types, Mathematical Structures in Computer Science (2000) pp. 575-594
6. (with Włodzimierz Moczurad) Some Open Problems in Decidability of Brick (Labelled Polyomino) Codes. In: Cocoon 2004, Lecture Notes in Computer Science 3106 (2004) pp. 72-81
7. (with Włodzimierz Moczurad) Decidability of simple brick codes. In: Mathematics and Computer Science III (Algorithms, Trees, Combinatorics and Probabilities), Trends in Mathematics, Birkhäuser (2004) pp. 541-542
8. (with Włodzimierz Moczurad) Asymptotic density of brick and word codes. In: Ars Combinatoria, 83 (2007) pp. 169-177
9. (with Włodzimierz Moczurad) How many figure sets are codes?, In: LATA 2008, Lecture Notes in Computer Science 5196 (2008) pp. 385-396

GRANTS:

1. 1993-1994 KBN (Committee for Scientific Research) grant. Coordinator dr hab. Marek Zaionc. Contract number 3 P406 019 05. Title: Lambda definability of higher order functionals
2. 1999-2000 KBN (Committee for Scientific Research) grant. Coordinator dr hab. Marek Zaionc. Contract number 8T11C01816. Title: Lambda calculus as a tool for higher order programming