Fletta eftir titli

Röðun: Raða: Niðurstöður:

  • Capobianco, Silvio; Uustalu, Tarmo (ACM, 2023-10-22)
    Cellular automata are an archetypical comonadic notion of computation in that computation happens in the coKleisli category of a comonad. In this paper, we show that they can also be viewed as graded comonadic—a perspective that turns out to be both ...
  • Uustalu, Tarmo; Voorneveld, Niels (Springer, 2020)
    Monad algebras, turning computations over return values into values, are used to handle algebraic effects invoked by programs, whereas comonad coalgebras, turning initial states into environments (“cocomputations”) over states, describe production of ...
  • McDermott, Dylan; Piróg, Maciej; Uustalu, Tarmo (ACM, 2020-09-08)
    We discuss the relationship between monads and their known generalisation, graded monads, which are especially useful for modelling computational effects equipped with a form of sequential composition. Specifically, we ask if a graded monad can be ...
  • McDermott, Dylan; Uustalu, Tarmo (Springer, 2022-09-22)
    When modelling side-effects using a monad, we need to equip the monad with effectful operations. This can be done by noting that each algebra of the monad carries interpretations of the desired operations. We consider the analogous situation for graded ...
  • Jonasson, Haukur Ingi; Ingason, Helgi (University of Technology, Sydney, 2018-06-08)
    Project management is essentially about solving problems and getting things done. The ability to imagine is a crucial ability when it comes to finding solutions and actualizing them. This paper looks at how creativity can, on an individual, team and ...
  • McDermott, Dylan; Morita, Yasuaki; Uustalu, Tarmo (Springer, 2022-10-03)
    We propose a new type system for WebAssembly. It is a refinement of the type system from the language specification and is based on type qualifiers and subtyping. In the WebAssembly specification, a typable instruction sequence gets many different ...