Contractive signatures with recursive types, type parameters, and abstract typesIm, Hyeonseung; Nakata, Keiko; Park, SungwooAutomata, Languages, and Programming : 40th International Colloquium, ICALP 2013, Riga, Latvia, July 8-12, 2013, Proceedings, Part II2013 / p. 299 - 311 https://doi.org/10.1007/978-3-642-39212-2_28 Conference Proceedings at Scopus Article at Scopus

Finiteness and rational sequences, constructivelyUustalu, Tarmo; Veltri, NiccoloJournal of functional programming2017 / art. e13, p. 1-20 https://doi.org/10.1017/S0956796817000041 Journal metrics at Scopus Article at Scopus Journal metrics at WOS Article at WOS

On streams that are finitely redBezem, Marc; Nakata, Keiko; Uustalu, TarmoLogical methods in computer science2012 / p. 1-20 https://www.researchgate.net/publication/231582269_On_streams_that_are_finitely_red

Optimized encodings of fragments of type theory in first-order logicTammet, Tanel; Smith, Jan M.Journal of logic and computation1998 / 6, p. 713-744 https://www.cse.chalmers.se/~smith/autolncs.pdf

Quotienting the delay monad by weak bisimilarityChapman, James; Uustalu, Tarmo; Veltri, NiccolòTheoretical Aspects of Computing - ICTAC 2015 : 12th International Colloquium, Cali, Colombia, October 29-31, 2015, Proceedings2015 / p. 110 - 125 https://doi.org/10.1007/978-3-319-25150-9_8 Conference Proceedings at Scopus Article at Scopus Conference Proceedings at WOS Article at WOS

Towards efficient subsumptionTammet, TanelAutomated Deduction - CADE 15 : proceedings : 15th International Conference on Automated Deduction : Lindau, Germany, July 5-10, 19981998 / p. 427-441 https://link.springer.com/chapter/10.1007/BFb0054276

21st International Conference on Types for Proofs and Programs : TYPES 2015, May 18-21, 2015, Tallinn, Estonia [Online resource]2018 http://doi.org/10.4230/lipics.types.2015.0 http://www.dagstuhl.de/dagpub/978-3-95977-030-9

21st International Conference on Types for Proofs and Programs, TYPES 2015 : Tallinn, Estonia, 18-21 May 2015 : abstracts2015 http://www.ester.ee/record=b4473137*est

Type systems equivalent to dataflow analyses for imperative languagesLaud, Peeter; Uustalu, Tarmo; Vene, VarmoProceedings of 3rd APPSEM II Workshop : APPSEM'05 : Frauenchiemsee, September 20052005 / [12] p https://www.sciencedirect.com/science/article/pii/S0304397506005524

Type-theoretic constructions of the final coalgebra of the finite powerset functorVeltri, Niccolo41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2021)2021 / p. 22:1-22:18 https://doi.org/10.4230/LIPIcs.FSCD.2021.22 Conference Proceedings at Scopus Article at Scopus

A type-theoretic potpourri: towards final coalgebrasof accessible functorsBasold, Henning; Veltri, NiccoloEUTYPES-TYPES 2020 : Abstracts2020 / 3 p https://types2020.di.unito.it/abstracts/BookOfAbstractsTYPES2020.pdf

A type-theoretical study of nontermination = Tüübiteoreetiline uurimus mittetermineeruvusestVeltri, Niccolo2017 https://digi.lib.ttu.ee/i/?7631