Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Wolfram Kahl
2010 – today
- 2012
[c24]Wolfram Kahl: Towards Certifiable Implementation of Graph Transformation via Relation Categories. RAMICS 2012: 82-97
[c23]Victor Bandur, Wolfram Kahl, Alan Wassyng: Microcontroller Assembly Synthesis from Timed Automaton Task Specifications. FMICS 2012: 63-77
[e1]Wolfram Kahl, Timothy G. Griffin (Eds.): Relational and Algebraic Methods in Computer Science - 13th International Conference, RAMiCS 2012, Cambridge, UK, September 17-20, 2012. Proceedings. Lecture Notes in Computer Science 7560, Springer 2012, ISBN 978-3-642-33313-2- 2011
[j13]Wolfram Kahl: Collagories: Relation-algebraic reasoning for gluing constructions. J. Log. Algebr. Program. 80(6): 297-338 (2011)
[c22]Wolfram Kahl: Dependently-Typed Formalisation of Relation-Algebraic Abstractions. RAMICS 2011: 230-247
[c21]Wolfram Kahl: The Teaching Tool CalcCheck A Proof-Checker for Gries and Schneider's "Logical Approach to Discrete Math". CPP 2011: 216-230
[c20]- 2010
[j12]
[j11]Wolfram Kahl: Determinisation of relational substitutions in ordered categories with domain. J. Log. Algebr. Program. 79(8): 812-829 (2010)
[c19]Wolfram Kahl: Amalgamating Pushout and Pullback Graph Transformation in Collagories. ICGT 2010: 362-378
2000 – 2009
- 2009
[j10]Scott West, Wolfram Kahl: A Generic Graph Transformation, Visualisation, and Editing Framework in Haskell. ECEASST 18 (2009)
[j9]Christopher Kumar Anand, Wolfram Kahl: An Optimized Cell BE Special Function Library Generated by Coconut. IEEE Trans. Computers 58(8): 1126-1138 (2009)
[c18]
[c17]Wolfram Kahl: Haskell Module Tools for Liberating Type Class Design. Trends in Functional Programming 2009: 129-144- 2008
[j8]Wolfram Kahl: Relational semigroupoids: Abstract relation-algebraic interfaces for finite relations between infinite types. J. Log. Algebr. Program. 76(1): 60-89 (2008)
[c16]Wolfram Kahl: Determinisation of Relational Substitutions in Ordered Categories with Domain. RelMiCS 2008: 243-258- 2007
[j7]Andrea Corradini, Fabio Gadducci, Wolfram Kahl, Barbara König: Inequational Deduction as Term Graph Rewriting. Electr. Notes Theor. Comput. Sci. 72(1): 31-44 (2007)
[c15]Christopher Kumar Anand, Wolfram Kahl: Code Graph Transformations for Verifiable Generation of SIMD-Parallel Assembly Code. AGTIVE 2007: 217-232
[c14]Christopher Kumar Anand, Wolfram Kahl: MultiLoop: efficient software pipelining for modern hardware. CASCON 2007: 260-263- 2006
[c13]Wolfram Kahl: Semigroupoid Interfaces for Relation-Algebraic Programming in Haskell. RelMiCS 2006: 235-250
[c12]Wolfram Kahl, Jacques Carette, Xiaoheng Ji: Bimonadic Semantics for Basic Pattern Matching Calculi. MPC 2006: 253-273- 2005
[c11]Wolfram Kahl, Christopher Kumar Anand, Jacques Carette: Control-Flow Semantics for Assembly-Level Data-Flow Graphs. RelMiCS 2005: 147-160- 2004
[c10]- 2003
[c9]- 2001
[j6]Wolfram Kahl: Refinement and Development of Programs from Relational Specifications. Electr. Notes Theor. Comput. Sci. 44(3): 51-93 (2001)
[j5]Wolfram Kahl, David Lorge Parnas, Gunther Schmidt: RelMiS 2001 - Preface. Electr. Notes Theor. Comput. Sci. 44(3): 221-223 (2001)
[j4]Wolfram Kahl: Parallel composition and decomposition of specifications. Inf. Sci. 139(3-4): 197-220 (2001)
[j3]Wolfram Kahl, Frank Derichsweiler: Declarative Term Graph Attribution for Program Generation. J. UCS 7(1): 54-70 (2001)
[c8]- 2000
[c7]
1990 – 1999
- 1999
[j2]Wolfram Kahl: Relational Matching for Graphical Calculi of Relations. Inf. Sci. 119(3-4): 253-273 (1999)
[c6]Wolfram Kahl: Beyond Pretty-Printing: Galley Concepts in Document Formatting Combinators. PADL 1999: 76-90- 1998
[j1]Wolfram Kahl: Relational Treatment of Term Graphs With Bound Variables. Logic Journal of the IGPL 6(2): 259-303 (1998)
[c5]
[c4]- 1997
[c3]- 1996
[b1]Wolfram Kahl: Algebraische Termgraphersetzung mit gebundenen Variablen. Informatik, Utz 1996, ISBN 978-3-931327-60-6, pp. I-VIII, 1-152
[c2]- 1994
[c1]Wolfram Kahl: Can Functional Programming Be Liberated from the Applicative Style? IFIP Congress (1) 1994: 330-335
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-04 22:17 CEST by the dblp team



