The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Tarmo Uustalu: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Neil Ghani, Tarmo Uustalu, Varmo Vene
    Build, Augment and Destroy, Universally. [Citation Graph (0, 0)][DBLP]
    APLAS, 2004, pp:327-347 [Conf]
  2. Tarmo Uustalu, Varmo Vene
    The Essence of Dataflow Programming. [Citation Graph (0, 0)][DBLP]
    APLAS, 2005, pp:2-18 [Conf]
  3. Tarmo Uustalu
    Combining Object-Oriented and Logic Paradigms: A Modal Logic Programming Approach. [Citation Graph (0, 0)][DBLP]
    ECOOP, 1992, pp:98-113 [Conf]
  4. Tarmo Uustalu
    Generalizing substitution. [Citation Graph (0, 0)][DBLP]
    FICS, 2002, pp:9-11 [Conf]
  5. Thorsten Altenkirch, Tarmo Uustalu
    Normalization by Evaluation for lambda-2. [Citation Graph (0, 0)][DBLP]
    FLOPS, 2004, pp:260-275 [Conf]
  6. Andreas Abel, Ralph Matthes, Tarmo Uustalu
    Generalized Iteration and Coiteration for Higher-Order Nested Datatypes. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 2003, pp:54-69 [Conf]
  7. Neil Ghani, Patricia Johann, Tarmo Uustalu, Varmo Vene
    Monadic augment and generalised short cut fusion. [Citation Graph (0, 0)][DBLP]
    ICFP, 2005, pp:294-305 [Conf]
  8. Neil Ghani, Tarmo Uustalu
    Explicit substitutions and higher-order syntax. [Citation Graph (0, 0)][DBLP]
    MERLIN, 2003, pp:- [Conf]
  9. Gilles Barthe, Tarmo Uustalu
    CPS translating inductive and coinductive types. [Citation Graph (0, 0)][DBLP]
    PEPM, 2002, pp:131-142 [Conf]
  10. Tarmo Uustalu, Varmo Vene
    The Dual of Substitution is Redecoration. [Citation Graph (0, 0)][DBLP]
    Scottish Functional Programming Workshop, 2001, pp:99-110 [Conf]
  11. Tarmo Uustalu
    Monad Translating Inductive and Coinductive Types. [Citation Graph (0, 0)][DBLP]
    TYPES, 2002, pp:299-315 [Conf]
  12. Tarmo Uustalu, Varmo Vene
    The Essence of Dataflow Programming. [Citation Graph (0, 0)][DBLP]
    CEFP, 2005, pp:135-167 [Conf]
  13. Venanzio Capretta, Tarmo Uustalu, Varmo Vene
    Recursive Coalgebras from Comonads. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2004, v:106, n:, pp:43-61 [Journal]
  14. Ralph Matthes, Tarmo Uustalu
    Substitution in Non-wellfounded Syntax with Variable Binding. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2003, v:82, n:1, pp:- [Journal]
  15. Ando Saabas, Tarmo Uustalu
    A Compositional Natural Semantics and Hoare Logic for Low-Level Languages. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2006, v:156, n:1, pp:151-168 [Journal]
  16. Venanzio Capretta, Tarmo Uustalu, Varmo Vene
    Recursive coalgebras from comonads. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2006, v:204, n:4, pp:437-468 [Journal]
  17. Tarmo Uustalu, Varmo Vene
    Primitive (Co)Recursion and Course-of-Value (Co)Iteration, Categorically. [Citation Graph (0, 0)][DBLP]
    Informatica, Lith. Acad. Sci., 1999, v:10, n:1, pp:5-26 [Journal]
  18. Tarmo Uustalu
    Generalizing Substitution. [Citation Graph (0, 0)][DBLP]
    ITA, 2003, v:37, n:4, pp:315-336 [Journal]
  19. Tarmo Uustalu, Varmo Vene
    Signals and Comonads. [Citation Graph (0, 0)][DBLP]
    J. UCS, 2005, v:11, n:7, pp:1310-1326 [Journal]
  20. Neil Ghani, Tarmo Uustalu, Makoto Hamana
    Explicit substitutions and higher-order syntax. [Citation Graph (0, 0)][DBLP]
    Higher-Order and Symbolic Computation, 2006, v:19, n:2-3, pp:263-282 [Journal]
  21. Gilles Barthe, Maria João Frade, E. Giménez, Luis Pinto, Tarmo Uustalu
    Type-based termination of recursive definitions. [Citation Graph (0, 0)][DBLP]
    Mathematical Structures in Computer Science, 2004, v:14, n:1, pp:97-141 [Journal]
  22. Tarmo Uustalu, Varmo Vene, Alberto Pardo
    Recursion Schemes from Comonads. [Citation Graph (0, 0)][DBLP]
    Nord. J. Comput., 2001, v:8, n:3, pp:366-390 [Journal]
  23. Tarmo Uustalu, Varmo Vene
    Mendler-Style Inductive Types, Categorically. [Citation Graph (0, 0)][DBLP]
    Nord. J. Comput., 1999, v:6, n:3, pp:343-0 [Journal]
  24. Andreas Abel, Ralph Matthes, Tarmo Uustalu
    Iteration and coiteration schemes for higher-order and nested datatypes. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:333, n:1-2, pp:3-66 [Journal]
  25. Peeter Laud, Tarmo Uustalu, Varmo Vene
    Type systems equivalent to data-flow analyses for imperative languages. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:364, n:3, pp:292-310 [Journal]
  26. Ralph Matthes, Tarmo Uustalu
    Substitution in non-wellfounded syntax with variable binding. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:327, n:1-2, pp:155-174 [Journal]
  27. Tarmo Uustalu, Varmo Vene
    Least and greatest fixed points in intuitionistic natural deduction. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:272, n:1-2, pp:315-339 [Journal]
  28. Ando Saabas, Tarmo Uustalu
    A compositional natural semantics and Hoare logic for low-level languages. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:373, n:3, pp:273-302 [Journal]
  29. Ichiro Hasuo, Bart Jacobs, Tarmo Uustalu
    Categorical Views on Computations on Trees (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    ICALP, 2007, pp:619-630 [Conf]
  30. Neil Ghani, Tarmo Uustalu, Varmo Vene
    Generalizing the AUGMENT combinator. [Citation Graph (0, 0)][DBLP]
    Trends in Functional Programming, 2004, pp:65-78 [Conf]
  31. Tarmo Uustalu, Varmo Vene
    Comonadic functional attribute evaluation. [Citation Graph (0, 0)][DBLP]
    Trends in Functional Programming, 2005, pp:145-162 [Conf]
  32. Maria João Frade, Ando Saabas, Tarmo Uustalu
    Foundational certification of data-flow analyses. [Citation Graph (0, 0)][DBLP]
    TASE, 2007, pp:107-116 [Conf]
  33. Ando Saabas, Tarmo Uustalu
    Type Systems for Optimizing Stack-based Code. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2007, v:190, n:1, pp:103-119 [Journal]

  34. Compositional Type Systems for Stack-Based Low-Level Languages. [Citation Graph (, )][DBLP]


  35. A Hoare Logic for the Coinductive Trace-Based Big-Step Semantics of While. [Citation Graph (, )][DBLP]


  36. Monads Need Not Be Endofunctors. [Citation Graph (, )][DBLP]


  37. Proof optimization for partial redundancy elimination. [Citation Graph (, )][DBLP]


  38. Bidirectional data-flow analyses, type-systematically. [Citation Graph (, )][DBLP]


  39. Proof Search and Counter-Model Construction for Bi-intuitionistic Propositional Logic with Labelled Sequents. [Citation Graph (, )][DBLP]


  40. Trace-Based Coinductive Operational Semantics for While. [Citation Graph (, )][DBLP]


  41. Program Repair as Sound Optimization of Broken Programs. [Citation Graph (, )][DBLP]


  42. Corecursive Algebras: A Study of General Structured Corecursion. [Citation Graph (, )][DBLP]


  43. Resumptions, Weak Bisimilarity and Big-Step Semantics for While with Interactive I/O: An Exercise in Mixed Induction-Coinduction [Citation Graph (, )][DBLP]


  44. Comonadic Notions of Computation. [Citation Graph (, )][DBLP]


Search in 0.000secs, Finished in 0.002secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002