#### Filter Results:

- Full text PDF available (83)

#### Publication Year

1992

2017

- This year (7)
- Last 5 years (25)
- Last 10 years (54)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Gilles Barthe, Maria JoÃ£o Frade, Eduardo GimÃ©nez, LuÃs Pinto, Tarmo Uustalu
- Mathematical Structures in Computer Science
- 2004

This paper introduces Î»Ì‚ , a simply typed lambda calculus supporting inductive types and recursive function definitions with termination ensured by types. The system is shown to enjoy subjectâ€¦ (More)

- Tarmo Uustalu, Varmo Vene, Alberto Pardo
- Nord. J. Comput.
- 2001

- Andreas Abel, Ralph Matthes, Tarmo Uustalu
- Theor. Comput. Sci.
- 2005

This article studies the implementation of inductive and coinductive constructors of higher kinds (higher-order nested datatypes) in typed term rewriting, with emphasis on the choice of the iterationâ€¦ (More)

- Venanzio Capretta, Tarmo Uustalu, Varmo Vene
- Inf. Comput.
- 2004

We discuss Osiusâ€™s [22] concept of a recursive coalgebra of a functor from the perspective of programming semantics and give some new sufficient conditions for the recursiveness of aâ€¦ (More)

- Thorsten Altenkirch, James Chapman, Tarmo Uustalu
- FOSSACS
- 2010

We introduce a generalisation of monads, called relative monads, allowing for underlying functors between different categories. Examples include finite-dimensional vector spaces, untyped and typedâ€¦ (More)

- Ralph Matthes, Tarmo Uustalu
- Theor. Comput. Sci.
- 2003

Inspired from the recent developments in theories of non-wellfounded syntax (coinductively defined languages) and of syntax with binding operators, the structure of algebras of wellfounded andâ€¦ (More)

- LuÃs Pinto, Tarmo Uustalu
- TABLEAUX
- 2009

Bi-intuitionistic logic is a conservative extension of intuitionistic logic with a connective dual to implication, called exclusion. We present a sound and complete cut-free labelled sequent calculusâ€¦ (More)

- Tarmo Uustalu, Varmo Vene
- CEFP
- 2005

Wepropose a novel, comonadic approach to dataflow (streambased) computation. This is based on the observation that both general and causal stream functions can be characterized as coKleisli arrows ofâ€¦ (More)

- Tarmo Uustalu, Varmo Vene
- Electr. Notes Theor. Comput. Sci.
- 2008

We argue that symmetric (semi)monoidal comonads provide a means to structure context-dependent notions of computation such as notions of dataflow computation (computation on streams) and of treeâ€¦ (More)

- Neil Ghani, Tarmo Uustalu
- ITA
- 2004

The question of how to combine monads arises naturally in many areas with much recent interest focusing on the coproduct of two monads. In general, the coproduct of arbitrary monads does not alwaysâ€¦ (More)