The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Wolfram Kahl: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Wolfram Kahl
    Unsharp Demonic Products and Stratified Term Graphs. [Citation Graph (0, 0)][DBLP]
    RelMiCS, 2000, pp:165-174 [Conf]
  2. Wolfram Kahl
    A Relation-Algebraic Approach to Graph Structure Transformation. [Citation Graph (0, 0)][DBLP]
    RelMiCS, 2001, pp:1-14 [Conf]
  3. Wolfram Kahl
    Calculational Relation-Algebraic Proofs in Isabelle/Isar. [Citation Graph (0, 0)][DBLP]
    RelMiCS, 2003, pp:178-190 [Conf]
  4. Wolfram Kahl
    Relational Matching for Graphical Calculi of Relations. [Citation Graph (0, 0)][DBLP]
    RelMiCS, 1997, pp:91-100 [Conf]
  5. Wolfram Kahl
    Demonic diagrams - towards a graphical refinement calculus. [Citation Graph (0, 0)][DBLP]
    RelMiCS, 1998, pp:117-121 [Conf]
  6. Wolfram Kahl
    Semigroupoid Interfaces for Relation-Algebraic Programming in Haskell. [Citation Graph (0, 0)][DBLP]
    RelMiCS, 2006, pp:235-250 [Conf]
  7. Wolfram Kahl, Christopher Kumar Anand, Jacques Carette
    Control-Flow Semantics for Assembly-Level Data-Flow Graphs. [Citation Graph (0, 0)][DBLP]
    RelMiCS, 2005, pp:147-160 [Conf]
  8. Wolfram Kahl
    Basic Pattern Matching Calculi: a Fresh View on Matching Failure. [Citation Graph (0, 0)][DBLP]
    FLOPS, 2004, pp:276-290 [Conf]
  9. Wolfram Kahl
    Can Functional Programming Be Liberated from the Applicative Style? [Citation Graph (0, 0)][DBLP]
    IFIP Congress (1), 1994, pp:330-335 [Conf]
  10. Wolfram Kahl, Jacques Carette, Xiaoheng Ji
    Bimonadic Semantics for Basic Pattern Matching Calculi. [Citation Graph (0, 0)][DBLP]
    MPC, 2006, pp:253-273 [Conf]
  11. Wolfram Kahl
    Beyond Pretty-Printing: Galley Concepts in Document Formatting Combinators. [Citation Graph (0, 0)][DBLP]
    PADL, 1999, pp:76-90 [Conf]
  12. Wolfram Kahl
    Algebraic Graph Derivations for Graphical Calculi. [Citation Graph (0, 0)][DBLP]
    WG, 1996, pp:224-238 [Conf]
  13. Wolfram Kahl
    Interally Typed Second-Order Term Graphs. [Citation Graph (0, 0)][DBLP]
    WG, 1998, pp:149-163 [Conf]
  14. Wolfram Kahl
    Refinement and Development of Programs from Relational Specifications. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2001, v:44, n:3, pp:- [Journal]
  15. Wolfram Kahl, David Lorge Parnas, Gunther Schmidt
    RelMiS 2001 - Preface. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2001, v:44, n:3, pp:- [Journal]
  16. Wolfram Kahl
    Relational Treatment of Term Graphs With Bound Variables. [Citation Graph (0, 0)][DBLP]
    Logic Journal of the IGPL, 1998, v:6, n:2, pp:259-303 [Journal]
  17. Wolfram Kahl
    Parallel composition and decomposition of specifications. [Citation Graph (0, 0)][DBLP]
    Inf. Sci., 2001, v:139, n:3-4, pp:197-220 [Journal]
  18. Wolfram Kahl
    Relational Matching for Graphical Calculi of Relations. [Citation Graph (0, 0)][DBLP]
    Inf. Sci., 1999, v:119, n:3-4, pp:253-273 [Journal]
  19. Wolfram Kahl, Frank Derichsweiler
    Declarative Term Graph Attribution for Program Generation. [Citation Graph (0, 0)][DBLP]
    J. UCS, 2001, v:7, n:1, pp:54-70 [Journal]

  20. Collagories for Relational Adhesive Rewriting. [Citation Graph (, )][DBLP]


  21. Determinisation of Relational Substitutions in Ordered Categories with Domain. [Citation Graph (, )][DBLP]


  22. Code Graph Transformations for Verifiable Generation of SIMD-Parallel Assembly Code. [Citation Graph (, )][DBLP]


  23. MultiLoop: efficient software pipelining for modern hardware. [Citation Graph (, )][DBLP]


  24. Amalgamating Pushout and Pullback Graph Transformation in Collagories. [Citation Graph (, )][DBLP]


  25. Inequational Deduction as Term Graph Rewriting. [Citation Graph (, )][DBLP]


Search in 0.013secs, Finished in 0.015secs
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