default search action
Danko Ilik
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
- [j5]Taus Brock-Nannestad, Danko Ilik
:
An intuitionistic formula hierarchy based on high-school identities. Math. Log. Q. 65(1): 57-79 (2019) - [i10]Danko Ilik:
Applications of the analogy between formulas and exponential polynomials to equivalence and normal forms. CoRR abs/1905.07621 (2019) - 2017
- [j4]Danko Ilik:
Perspectives for Proof Unwinding by Programming Languages Techniques. FLAP 4(10): 3483-3504 (2017) - [c7]Danko Ilik
The exp-log normal form of types: decomposing extensional equality and representing terms compactly. POPL 2017: 387-399 - 2016
- [i9]Taus Brock-Nannestad, Danko Ilik:
An Intuitionistic Formula Hierarchy Based on High-School Identities. CoRR abs/1601.04876 (2016) - [i8]Danko Ilik
Perspectives for proof unwinding by programming languages techniques. CoRR abs/1605.09177 (2016) - 2015
- [i7]Danko Ilik
The Exp-Log Normal Form of Types and Canonical Terms for Lambda Calculus with Sums. CoRR abs/1502.04634 (2015) - 2014
- [c6]Danko Ilik
Axioms and decidability for type isomorphism in the presence of sums. CSL-LICS 2014: 53:1-53:7 - [c5]Danko Ilik
Proofs in continuation-passing style: normalization of Gödel's System T extended with sums and delimited control operators: Distilled Tutorial. PPDP 2014: 55-56 - [i6]Danko Ilik:
Axioms and Decidability for Type Isomorphism in the Presence of Sums. CoRR abs/1401.2567 (2014) - 2013
- [j3]Danko Ilik
Continuation-passing style models complete for intuitionistic logic. Ann. Pure Appl. Log. 164(6): 651-662 (2013) - [c4]Zoran Utkovski, Danko Ilik, Ljupco Kocarev:
An achievable Pre-log Region for the Non-coherent Block Fading MIMO Multiple Access Channel. ISWCS 2013: 1-5 - [c3]Danko Ilik
A Direct Version of Veldman's Proof of Open Induction on Cantor Space via Delimited Control Operators. TYPES 2013: 188-201 - [c2]Danko Ilik
A formalized type-directed partial evaluator for shift and reset. COS 2013: 86-100 - [i5]Danko Ilik:
Double-negation Shift as a constructive principle. CoRR abs/1301.5089 (2013) - 2012
- [j2]Danko Ilik
Delimited control operators prove Double-negation Shift. Ann. Pure Appl. Log. 163(11): 1549-1559 (2012) - [i4]Danko Ilik, Keiko Nakata:
A Constructive Proof of Open Induction Using Delimited Control Operators. CoRR abs/1209.2229 (2012) - 2011
- [i3]Danko Ilik:
Continuation-passing Style Models Complete for Intuitionistic Logic. CoRR abs/1102.1061 (2011) - 2010
- [b1]Danko Ilik:
Constructive Completeness Proofs and Delimited Control. (Preuves constructives de complétude et contrôle délimité). École Polytechnique, Palaiseau, France, 2010 - [j1]Danko Ilik
Kripke models for classical logic. Ann. Pure Appl. Log. 161(11): 1367-1378 (2010) - [i2]Danko Ilik:
Delimited control operators prove Double-negation Shift. CoRR abs/1012.0929 (2010)
2000 – 2009
- 2009
- [i1]Danko Ilik, Gyesik Lee, Hugo Herbelin:
Kripke Models for Classical Logic. CoRR abs/0904.0071 (2009) - 2006
- [c1]Danko Ilik
Zermelo's Well-Ordering Theorem in Type Theory. TYPES 2006: 175-187
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 2024-04-25 05:49 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: