The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Varmo Vene: [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. Peeter Laud, Varmo Vene
    A Type System for Computationally Secure Information Flow. [Citation Graph (0, 0)][DBLP]
    FCT, 2005, pp:365-377 [Conf]
  4. 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]
  5. Jevgeni Kabanov, Varmo Vene
    Recursion Schemes for Dynamic Programming. [Citation Graph (0, 0)][DBLP]
    MPC, 2006, pp:235-252 [Conf]
  6. Tarmo Uustalu, Varmo Vene
    The Dual of Substitution is Redecoration. [Citation Graph (0, 0)][DBLP]
    Scottish Functional Programming Workshop, 2001, pp:99-110 [Conf]
  7. Tarmo Uustalu, Varmo Vene
    The Essence of Dataflow Programming. [Citation Graph (0, 0)][DBLP]
    CEFP, 2005, pp:135-167 [Conf]
  8. 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]
  9. 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]
  10. Merik Meriste, Jaan Penjam, Varmo Vene
    Models of Attributed Automata. [Citation Graph (0, 0)][DBLP]
    Informatica, Lith. Acad. Sci., 1998, v:9, n:1, pp:85-105 [Journal]
  11. 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]
  12. Tarmo Uustalu, Varmo Vene
    Signals and Comonads. [Citation Graph (0, 0)][DBLP]
    J. UCS, 2005, v:11, n:7, pp:1310-1326 [Journal]
  13. 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]
  14. 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]
  15. 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]
  16. 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]
  17. Neil Ghani, Tarmo Uustalu, Varmo Vene
    Generalizing the AUGMENT combinator. [Citation Graph (0, 0)][DBLP]
    Trends in Functional Programming, 2004, pp:65-78 [Conf]
  18. Tarmo Uustalu, Varmo Vene
    Comonadic functional attribute evaluation. [Citation Graph (0, 0)][DBLP]
    Trends in Functional Programming, 2005, pp:145-162 [Conf]

  19. A Smooth Combination of Linear and Herbrand Equalities for Polynomial Time Must-Alias Analysis. [Citation Graph (, )][DBLP]


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


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


Search in 0.005secs, Finished in 0.006secs
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