default search action
Katarzyna Grygiel
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
- [j8]Katarzyna Grygiel, Isabella Larcher:
Unary profile of lambda terms with restricted De Bruijn indices. Discret. Math. Theor. Comput. Sci. 22(3) (2021)
2010 – 2019
- 2018
- [j7]Maciej Bendkowski, Katarzyna Grygiel, Paul Tarau:
Random generation of closed simply typed λ-terms: A synergy between logic programming and Boltzmann samplers. Theory Pract. Log. Program. 18(1): 97-119 (2018) - 2017
- [j6]Maciej Bendkowski, Katarzyna Grygiel, Marek Zaionc:
On the likelihood of normalization in combinatory logic. J. Log. Comput. 27(7): 2251-2269 (2017) - [j5]Maciej Bendkowski, Katarzyna Grygiel, Pierre Lescanne, Marek Zaionc:
Combinatorics of $$\lambda$$-terms: a natural approach. J. Log. Comput. 27(8): 2611-2630 (2017) - [c3]Maciej Bendkowski, Katarzyna Grygiel, Paul Tarau:
Boltzmann Samplers for Closed Simply-Typed Lambda Terms. PADL 2017: 120-135 - 2016
- [c2]Maciej Bendkowski, Katarzyna Grygiel, Pierre Lescanne, Marek Zaionc:
A Natural Counting of Lambda Terms. SOFSEM 2016: 183-194 - [i8]Maciej Bendkowski, Katarzyna Grygiel, Marek Zaionc:
On the likelihood of normalisation in combinatory logic. CoRR abs/1607.04908 (2016) - [i7]Maciej Bendkowski, Katarzyna Grygiel, Pierre Lescanne, Marek Zaionc:
Combinatorics of λ-terms: a natural approach. CoRR abs/1609.07593 (2016) - [i6]Maciej Bendkowski, Katarzyna Grygiel, Paul Tarau:
Random generation of closed simply-typed $λ$-terms: a synergy between logic programming and Boltzmann samplers. CoRR abs/1612.07682 (2016) - 2015
- [j4]Katarzyna Grygiel, Pierre Lescanne:
Counting and generating terms in the binary lambda calculus. J. Funct. Program. 25 (2015) - [c1]Maciej Bendkowski, Katarzyna Grygiel, Marek Zaionc:
Asymptotic Properties of Combinatory Logic. TAMC 2015: 62-72 - [i5]Maciej Bendkowski, Katarzyna Grygiel, Pierre Lescanne, Marek Zaionc:
A natural counting of Lambda terms. CoRR abs/1506.02367 (2015) - [i4]Katarzyna Grygiel, Pierre Lescanne:
Counting and Generating Terms in the Binary Lambda Calculus (Extended version). CoRR abs/1511.05334 (2015) - 2014
- [i3]Katarzyna Grygiel, Pierre Lescanne:
Counting Terms in the Binary Lambda Calculus. CoRR abs/1401.0379 (2014) - 2013
- [j3]Katarzyna Grygiel, Pierre Lescanne:
Counting and generating lambda terms. J. Funct. Program. 23(5): 594-628 (2013) - [j2]Katarzyna Grygiel, Pawel M. Idziak, Marek Zaionc:
How big is BCI fragment of BCK logic. J. Log. Comput. 23(3): 673-691 (2013) - 2012
- [i2]Katarzyna Grygiel, Pierre Lescanne:
Counting and generating lambda terms. CoRR abs/1210.2610 (2012) - 2011
- [i1]Katarzyna Grygiel, Pawel M. Idziak, Marek Zaionc:
How big is BCI fragment of BCK logic. CoRR abs/1112.0643 (2011)
2000 – 2009
- 2009
- [j1]René David, Christophe Raffalli, Guillaume Theyssier, Katarzyna Grygiel, Jakub Kozik, Marek Zaionc:
Some properties of random lambda terms. Log. Methods Comput. Sci. 9(1) (2009)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-09 13:26 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint