×
Author ID: uustalu.tarmo Recent zbMATH articles by "Uustalu, Tarmo"
Published as: Uustalu, Tarmo; Uustalu, T.
Homepage: http://cs.ioc.ee/~tarmo/
External Links: MGP · ORCID · dblp · GND

Publications by Year

Citations contained in zbMATH Open

65 Publications have been cited 401 times in 258 Documents Cited by Year
Monads need not be endofunctors. Zbl 1448.18007
Altenkirch, Thorsten; Chapman, James; Uustalu, Tarmo
26
2015
Type-based termination of recursive definitions. Zbl 1054.68027
Barthe, G.; Frade, M. J.; Giménez, E.; Pinto, L.; Uustalu, T.
23
2004
Primitive (co)recursion and course-of-value (co) iteration, categorically. Zbl 0935.68011
Uustalu, Tarmo; Vene, Varmo
18
1999
Iteration and coiteration schemes for higher-order and nested datatypes. Zbl 1070.68093
Abel, Andreas; Matthes, Ralph; Uustalu, Tarmo
18
2005
Monads need not be endofunctors. Zbl 1284.18010
Altenkirch, Thorsten; Chapman, James; Uustalu, Tarmo
16
2010
Generalizing substitution. Zbl 1042.18003
Uustalu, Tarmo
16
2003
Comonadic notions of computation. Zbl 1279.68088
Uustalu, Tarmo; Vene, Varmo
16
2008
Substitution in non-wellfounded syntax with variable binding. Zbl 1071.68063
Matthes, Ralph; Uustalu, Tarmo
13
2004
Combining effects and coeffects via grading. Zbl 1361.68037
Gaboardi, Marco; Katsumata, Shin-ya; Orchard, Dominic; Breuvart, Flavien; Uustalu, Tarmo
12
2016
Corecursive algebras: a study of general structured corecursion. Zbl 1266.68083
Capretta, Venanzio; Uustalu, Tarmo; Vene, Varmo
11
2009
Recursion schemes from comonads. Zbl 0994.68018
Uustalu, Tarmo; Vene, Varmo; Pardo, Alberto
11
2001
Proof search and counter-model construction for bi-intuitionistic propositional logic with labelled sequents. Zbl 1260.03105
Pinto, Luís; Uustalu, Tarmo
10
2009
Recursive coalgebras from comonads. Zbl 1110.68068
Capretta, Venanzio; Uustalu, Tarmo; Vene, Varmo
10
2006
Explicit substitutions and higher-order syntax. Zbl 1105.68021
Ghani, Neil; Uustalu, Tarmo; Hamana, Makoto
10
2006
Coproducts of ideal monads. Zbl 1072.18006
Ghani, Neil; Uustalu, Tarmo
10
2004
Functional programming with apomorphisms (corecursion). Zbl 0963.68028
Vene, Varmo; Uustalu, Tarmo
9
1998
Mendler-style inductive types, categorically. Zbl 0937.68029
Uustalu, Tarmo; Vene, Varmo
8
1999
A Hoare logic for the coinductive trace-based big-step semantics of While. Zbl 1260.68111
Nakata, Keiko; Uustalu, Tarmo
8
2010
When is a container a comonad? Zbl 1338.68172
Ahman, Danel; Chapman, James; Uustalu, Tarmo
8
2014
A compositional natural semantics and Hoare logic for low-level languages. Zbl 1111.68071
Saabas, Ando; Uustalu, Tarmo
7
2007
Stateful runners of effectful computations. Zbl 1351.68104
Uustalu, Tarmo
7
2015
Interaction laws of monads and comonads. Zbl 1499.68065
Katsumata, Shin-ya; Rivas, Exequiel; Uustalu, Tarmo
7
2020
Trace-based coinductive operational semantics for While. Big-step and small-step, relational and functional styles. Zbl 1252.68056
Nakata, Keiko; Uustalu, Tarmo
6
2009
Program and proof optimizations with type systems. Zbl 1151.68008
Saabas, Ando; Uustalu, Tarmo
6
2008
Coherence for skew-monoidal categories. Zbl 1464.18018
Uustalu, Tarmo
6
2014
Quotienting the delay monad by weak bisimilarity. Zbl 1407.68306
Chapman, James; Uustalu, Tarmo; Veltri, Niccolò
6
2019
Resumptions, weak bisimilarity and big-step semantics for While with interactive I/O: an exercise in mixed induction-coinduction. Zbl 1455.68100
Nakata, Keiko; Uustalu, Tarmo
5
2010
Codensity lifting of monads and its dual. Zbl 1398.18005
Katsumata, Shin-Ya; Sato, Tetsuya; Uustalu, Tarmo
5
2018
On streams that are finitely red. Zbl 1267.03058
Bezem, Marc; Nakata, Keiko; Uustalu, Tarmo
4
2012
Container combinatorics: monads and lax monoidal functors. Zbl 1485.18004
Uustalu, Tarmo
4
2017
Type systems equivalent to data-flow analyses for imperative languages. Zbl 1153.68351
Laud, Peeter; Uustalu, Tarmo; Vene, Varmo
4
2006
Quotienting the delay monad by weak bisimilarity. Zbl 1407.68305
Chapman, James; Uustalu, Tarmo; Veltri, Niccolò
4
2015
Monadic augment and generalised short cut fusion. Zbl 1302.68079
Ghani, Neil; Johann, Patricia; Uustalu, Tarmo; Vene, Varmo
4
2005
Update monads: cointerpreting directed containers. Zbl 1359.68049
Ahman, Danel; Uustalu, Tarmo
4
2014
Directed containers as categories. Zbl 1477.68169
Ahman, Danel; Uustalu, Tarmo
4
2016
The sequent calculus of skew monoidal categories. Zbl 1523.18017
Uustalu, Tarmo; Veltri, Niccolò; Zeilberger, Noam
4
2018
A compositional natural semantics and Hoare logic for low-level languages. Zbl 1273.68215
Saabas, Ando; Uustalu, Tarmo
4
2006
Modal embeddings and calling paradigms. Zbl 1528.03123
Espírito Santo, José; Pinto, Luís; Uustalu, Tarmo
4
2019
Normalization by evaluation for \(\lambda ^{\rightarrow 2}\). Zbl 1122.68393
Altenkirch, Thorsten; Uustalu, Tarmo
3
2004
Least and greatest fixed points in intuitionistic natural deduction. Zbl 0984.68136
Uustalu, Tarmo; Vene, Varmo
3
2002
Build, augment and destroy, universally. Zbl 1116.68490
Ghani, Neil; Uustalu, Tarmo; Vene, Varmo
3
2004
A divertimento on MonadPlus and nondeterminism. Zbl 1355.68041
Uustalu, Tarmo
3
2016
The delay monad and restriction categories. Zbl 1444.18010
Uustalu, Tarmo; Veltri, Niccolò
3
2017
A Hoare logic for the coinductive trace-based big-step semantics of While. Zbl 1448.68281
Nakata, Keiko; Uustalu, Tarmo
3
2015
Generalized iteration and coiteration for higher-order nested datatypes. Zbl 1029.68097
Abel, Andreas; Matthes, Ralph; Uustalu, Tarmo
3
2003
Substitution in non-wellfounded syntax with variable binding. Zbl 1270.68089
Matthes, Ralph; Uustalu, Tarmo
3
2003
Relating sequent calculi for bi-intuitionistic propositional logic. Zbl 1456.03022
Pinto, Luís; Uustalu, Tarmo
3
2011
When is a container a comonad? Zbl 1338.68171
Ahman, Danel; Chapman, James; Uustalu, Tarmo
2
2012
The recursion scheme from the cofree recursive comonad. Zbl 1291.68149
Uustalu, Tarmo; Vene, Varmo
2
2011
Coalgebraic update lenses. Zbl 1337.68084
Ahman, Danel; Uustalu, Tarmo
2
2014
The sequent calculus of skew monoidal categories. Zbl 1495.03073
Uustalu, Tarmo; Veltri, Niccolò; Zeilberger, Noam
2
2021
Proof theory of partially normal skew monoidal categories. Zbl 1477.18041
Uustalu, Tarmo; Veltri, Niccolò; Zeilberger, Noam
2
2021
Plotkin’s call-by-value \(\lambda\)-calculus as a modal calculus. Zbl 07531442
Santo, José Espírito; Pinto, Luís; Uustalu, Tarmo
2
2022
Relative monads formalised. Zbl 1451.68330
Altenkirch, Thorsten; Chapman, James; Uustalu, Tarmo
2
2014
Algebraic and coalgebraic perspectives on interaction laws. Zbl 1476.68066
Uustalu, Tarmo; Voorneveld, Niels
2
2020
Proof optimization for partial redundancy elimination. Zbl 1187.68167
Saabas, Ando; Uustalu, Tarmo
1
2009
The essence of dataflow programming. Zbl 1156.68378
Uustalu, Tarmo; Vene, Varmo
1
2006
Certified CYK parsing of context-free languages. Zbl 1371.68137
Firsov, Denis; Uustalu, Tarmo
1
2014
Finiteness and rational sequences, constructively. Zbl 1418.68069
Uustalu, Tarmo; Veltri, Niccolò
1
2017
Certified parsing of regular languages. Zbl 1303.68077
Firsov, Denis; Uustalu, Tarmo
1
2013
A coalgebraic view of bar recursion and bar induction. Zbl 1474.03105
Capretta, Venanzio; Uustalu, Tarmo
1
2016
Flexibly graded monads and graded algebras. Zbl 07705359
McDermott, Dylan; Uustalu, Tarmo
1
2022
Formalizing restriction categories. Zbl 1451.68338
Chapman, James; Uustalu, Tarmo; Veltri, Niccolò
1
2017
Recursive coalgebras from comonads. Zbl 1271.18005
Capretta, Venanzio; Uustalu, Tarmo; Vene, Varmo
1
2004
Theoretical aspects of computing – ICTAC 2018. 15th international colloquium, Stellenbosch, South Africa, October 16–19, 2018. Proceedings. Zbl 1398.68027
1
2018
Plotkin’s call-by-value \(\lambda\)-calculus as a modal calculus. Zbl 07531442
Santo, José Espírito; Pinto, Luís; Uustalu, Tarmo
2
2022
Flexibly graded monads and graded algebras. Zbl 07705359
McDermott, Dylan; Uustalu, Tarmo
1
2022
The sequent calculus of skew monoidal categories. Zbl 1495.03073
Uustalu, Tarmo; Veltri, Niccolò; Zeilberger, Noam
2
2021
Proof theory of partially normal skew monoidal categories. Zbl 1477.18041
Uustalu, Tarmo; Veltri, Niccolò; Zeilberger, Noam
2
2021
Interaction laws of monads and comonads. Zbl 1499.68065
Katsumata, Shin-ya; Rivas, Exequiel; Uustalu, Tarmo
7
2020
Algebraic and coalgebraic perspectives on interaction laws. Zbl 1476.68066
Uustalu, Tarmo; Voorneveld, Niels
2
2020
Quotienting the delay monad by weak bisimilarity. Zbl 1407.68306
Chapman, James; Uustalu, Tarmo; Veltri, Niccolò
6
2019
Modal embeddings and calling paradigms. Zbl 1528.03123
Espírito Santo, José; Pinto, Luís; Uustalu, Tarmo
4
2019
Codensity lifting of monads and its dual. Zbl 1398.18005
Katsumata, Shin-Ya; Sato, Tetsuya; Uustalu, Tarmo
5
2018
The sequent calculus of skew monoidal categories. Zbl 1523.18017
Uustalu, Tarmo; Veltri, Niccolò; Zeilberger, Noam
4
2018
Theoretical aspects of computing – ICTAC 2018. 15th international colloquium, Stellenbosch, South Africa, October 16–19, 2018. Proceedings. Zbl 1398.68027
1
2018
Container combinatorics: monads and lax monoidal functors. Zbl 1485.18004
Uustalu, Tarmo
4
2017
The delay monad and restriction categories. Zbl 1444.18010
Uustalu, Tarmo; Veltri, Niccolò
3
2017
Finiteness and rational sequences, constructively. Zbl 1418.68069
Uustalu, Tarmo; Veltri, Niccolò
1
2017
Formalizing restriction categories. Zbl 1451.68338
Chapman, James; Uustalu, Tarmo; Veltri, Niccolò
1
2017
Combining effects and coeffects via grading. Zbl 1361.68037
Gaboardi, Marco; Katsumata, Shin-ya; Orchard, Dominic; Breuvart, Flavien; Uustalu, Tarmo
12
2016
Directed containers as categories. Zbl 1477.68169
Ahman, Danel; Uustalu, Tarmo
4
2016
A divertimento on MonadPlus and nondeterminism. Zbl 1355.68041
Uustalu, Tarmo
3
2016
A coalgebraic view of bar recursion and bar induction. Zbl 1474.03105
Capretta, Venanzio; Uustalu, Tarmo
1
2016
Monads need not be endofunctors. Zbl 1448.18007
Altenkirch, Thorsten; Chapman, James; Uustalu, Tarmo
26
2015
Stateful runners of effectful computations. Zbl 1351.68104
Uustalu, Tarmo
7
2015
Quotienting the delay monad by weak bisimilarity. Zbl 1407.68305
Chapman, James; Uustalu, Tarmo; Veltri, Niccolò
4
2015
A Hoare logic for the coinductive trace-based big-step semantics of While. Zbl 1448.68281
Nakata, Keiko; Uustalu, Tarmo
3
2015
When is a container a comonad? Zbl 1338.68172
Ahman, Danel; Chapman, James; Uustalu, Tarmo
8
2014
Coherence for skew-monoidal categories. Zbl 1464.18018
Uustalu, Tarmo
6
2014
Update monads: cointerpreting directed containers. Zbl 1359.68049
Ahman, Danel; Uustalu, Tarmo
4
2014
Coalgebraic update lenses. Zbl 1337.68084
Ahman, Danel; Uustalu, Tarmo
2
2014
Relative monads formalised. Zbl 1451.68330
Altenkirch, Thorsten; Chapman, James; Uustalu, Tarmo
2
2014
Certified CYK parsing of context-free languages. Zbl 1371.68137
Firsov, Denis; Uustalu, Tarmo
1
2014
Certified parsing of regular languages. Zbl 1303.68077
Firsov, Denis; Uustalu, Tarmo
1
2013
On streams that are finitely red. Zbl 1267.03058
Bezem, Marc; Nakata, Keiko; Uustalu, Tarmo
4
2012
When is a container a comonad? Zbl 1338.68171
Ahman, Danel; Chapman, James; Uustalu, Tarmo
2
2012
Relating sequent calculi for bi-intuitionistic propositional logic. Zbl 1456.03022
Pinto, Luís; Uustalu, Tarmo
3
2011
The recursion scheme from the cofree recursive comonad. Zbl 1291.68149
Uustalu, Tarmo; Vene, Varmo
2
2011
Monads need not be endofunctors. Zbl 1284.18010
Altenkirch, Thorsten; Chapman, James; Uustalu, Tarmo
16
2010
A Hoare logic for the coinductive trace-based big-step semantics of While. Zbl 1260.68111
Nakata, Keiko; Uustalu, Tarmo
8
2010
Resumptions, weak bisimilarity and big-step semantics for While with interactive I/O: an exercise in mixed induction-coinduction. Zbl 1455.68100
Nakata, Keiko; Uustalu, Tarmo
5
2010
Corecursive algebras: a study of general structured corecursion. Zbl 1266.68083
Capretta, Venanzio; Uustalu, Tarmo; Vene, Varmo
11
2009
Proof search and counter-model construction for bi-intuitionistic propositional logic with labelled sequents. Zbl 1260.03105
Pinto, Luís; Uustalu, Tarmo
10
2009
Trace-based coinductive operational semantics for While. Big-step and small-step, relational and functional styles. Zbl 1252.68056
Nakata, Keiko; Uustalu, Tarmo
6
2009
Proof optimization for partial redundancy elimination. Zbl 1187.68167
Saabas, Ando; Uustalu, Tarmo
1
2009
Comonadic notions of computation. Zbl 1279.68088
Uustalu, Tarmo; Vene, Varmo
16
2008
Program and proof optimizations with type systems. Zbl 1151.68008
Saabas, Ando; Uustalu, Tarmo
6
2008
A compositional natural semantics and Hoare logic for low-level languages. Zbl 1111.68071
Saabas, Ando; Uustalu, Tarmo
7
2007
Recursive coalgebras from comonads. Zbl 1110.68068
Capretta, Venanzio; Uustalu, Tarmo; Vene, Varmo
10
2006
Explicit substitutions and higher-order syntax. Zbl 1105.68021
Ghani, Neil; Uustalu, Tarmo; Hamana, Makoto
10
2006
Type systems equivalent to data-flow analyses for imperative languages. Zbl 1153.68351
Laud, Peeter; Uustalu, Tarmo; Vene, Varmo
4
2006
A compositional natural semantics and Hoare logic for low-level languages. Zbl 1273.68215
Saabas, Ando; Uustalu, Tarmo
4
2006
The essence of dataflow programming. Zbl 1156.68378
Uustalu, Tarmo; Vene, Varmo
1
2006
Iteration and coiteration schemes for higher-order and nested datatypes. Zbl 1070.68093
Abel, Andreas; Matthes, Ralph; Uustalu, Tarmo
18
2005
Monadic augment and generalised short cut fusion. Zbl 1302.68079
Ghani, Neil; Johann, Patricia; Uustalu, Tarmo; Vene, Varmo
4
2005
Type-based termination of recursive definitions. Zbl 1054.68027
Barthe, G.; Frade, M. J.; Giménez, E.; Pinto, L.; Uustalu, T.
23
2004
Substitution in non-wellfounded syntax with variable binding. Zbl 1071.68063
Matthes, Ralph; Uustalu, Tarmo
13
2004
Coproducts of ideal monads. Zbl 1072.18006
Ghani, Neil; Uustalu, Tarmo
10
2004
Normalization by evaluation for \(\lambda ^{\rightarrow 2}\). Zbl 1122.68393
Altenkirch, Thorsten; Uustalu, Tarmo
3
2004
Build, augment and destroy, universally. Zbl 1116.68490
Ghani, Neil; Uustalu, Tarmo; Vene, Varmo
3
2004
Recursive coalgebras from comonads. Zbl 1271.18005
Capretta, Venanzio; Uustalu, Tarmo; Vene, Varmo
1
2004
Generalizing substitution. Zbl 1042.18003
Uustalu, Tarmo
16
2003
Generalized iteration and coiteration for higher-order nested datatypes. Zbl 1029.68097
Abel, Andreas; Matthes, Ralph; Uustalu, Tarmo
3
2003
Substitution in non-wellfounded syntax with variable binding. Zbl 1270.68089
Matthes, Ralph; Uustalu, Tarmo
3
2003
Least and greatest fixed points in intuitionistic natural deduction. Zbl 0984.68136
Uustalu, Tarmo; Vene, Varmo
3
2002
Recursion schemes from comonads. Zbl 0994.68018
Uustalu, Tarmo; Vene, Varmo; Pardo, Alberto
11
2001
Primitive (co)recursion and course-of-value (co) iteration, categorically. Zbl 0935.68011
Uustalu, Tarmo; Vene, Varmo
18
1999
Mendler-style inductive types, categorically. Zbl 0937.68029
Uustalu, Tarmo; Vene, Varmo
8
1999
Functional programming with apomorphisms (corecursion). Zbl 0963.68028
Vene, Varmo; Uustalu, Tarmo
9
1998
all top 5

Cited by 301 Authors

31 Uustalu, Tarmo
13 Milius, Stefan
13 Veltri, Niccolò
10 Abel, Andreas M.
9 Adámek, Jiří
9 Goncharov, Sergeĭ Savost’yanovich
8 Ahrens, Benedikt
8 Schröder, Lutz
7 Hirschowitz, André
7 Katsumata, Shin-ya
7 Orchard, Dominic A.
7 Velebil, Jiří
6 Ahman, Danel
6 Ghani, Neil
6 Lafont, Ambroise
6 Maggesi, Marco
6 Matthes, Ralph
6 Rauch, Christoph
5 Jacobs, Bart
5 Johann, Patricia
5 Wu, Nicolas
4 Altenkirch, Thorsten
4 Blanqui, Frédéric
4 Capretta, Venanzio
4 Dagnino, Francesco
4 Fiore, Marcelo P.
4 McDermott, Dylan
4 Moss, Lawrence S.
4 Piróg, Maciej
4 Staton, Sam
4 Vene, Varmo
4 Zeilberger, Noam
3 Barthe, Gilles
3 Berger, Ulrich
3 Eades, Harley III
3 Garner, Richard
3 Gibbons, Jeremy
3 Grégoire, Benjamin
3 Hasuo, Ichiro
3 Hirschowitz, Tom
3 Levy, Paul Blain
3 McBride, Conor Thomas
3 Rivas, Exequiel
3 Saabas, Ando
3 Sato, Tetsuya
3 Stump, Aaron
3 Voorneveld, Niels F. W.
2 Abramsky, Samson
2 Aguirre, Alejandro
2 Allais, Guillaume
2 Atkey, Robert
2 Beringer, Lennart
2 Bourke, John
2 Bove, Ana
2 Bucciarelli, Antonio
2 Chapman, James T. E.
2 Chaudhuri, Kaustuv
2 Czajka, Łukasz
2 Dal Lago, Ugo
2 El-Zawawy, Mohamed A.
2 Firsov, Denis
2 Galmiche, Didier
2 Guatto, Adrien
2 Hamana, Makoto
2 Hansen, Helle Hvid
2 Hinze, Ralf
2 Hutton, Graham
2 Hyland, J. Martin E.
2 Jaskelioff, Mauro
2 Jenkins, Christopher
2 Kesner, Delia
2 Kozen, Dexter C.
2 Lobbia, Gabriele
2 Méry, Daniel
2 Metcalfe, George
2 Miranda Perea, Favio Ezequiel
2 Mörtberg, Anders
2 Noquez, Victoria
2 Pfenning, Frank
2 Pientka, Brigitte
2 Pous, Damien
2 Reis, Giselle
2 Rennela, Mathys
2 Riba, Colin
2 Ríos, Alejandro
2 Rot, Jurriaan
2 Santschi, Simon
2 Schäfer, Steven
2 Schrijvers, Tom
2 Setzer, Anton
2 Silva, Alexandra
2 Torrini, Paolo
2 van der Weide, Niels
2 van Gool, Samuel Jacob
2 Vezzosi, Andrea
2 Viso, Andrés
2 Voevodskiĭ, Vladimir Aleksandrovich
2 Voigtlander, Janis
2 Yang, Zhixuan
2 Zucca, Elena
...and 201 more Authors

Citations by Year