Reasoning about Term Rewriting in Kleene Categories with Converse (2008)
Toshinori Takai, Hitoshi Furusawa, Wolfram Kahl, Toshinori Takai, Hitoshi Furusawa, Wolfram Kahl
Abstract. This paper shows that “root-only ” rewrite relations with respect to term rewriting systems can be expressed using Kleene star operations in a gs-monoidal Kleene category with converse....
Abstract Inequational Deduction as Term Graph Rewriting 1 (2008)
Andrea Corradini, Fabio Gadducci, Wolfram Kahl, Barbara König
Multi-algebras allow to model nondeterminism in an algebraic framework by interpreting operators as functions from individual arguments to sets of possible results. We propose a simple inequational...
Table Algebras: Algebraic Structures for Tabular Notation, Including Nested Headers (2008)
Hitoshi Furusawa, Wolfram Kahl, Hitoshi Furusawa, Wolfram Kahl
Abstract. We define a class of algebraic structures for the interpretation of tabular notations common in software requirements documentation and show how to use table algebra homomorphisms to define...
Declarative Term Graph Attribution for Program Generation (2008)
Wolfram Kahl, Frank Derichsweiler
Abstract: We show how the declarative spirit of attribute grammars can be employed to define an attribution mechanism for term graphs, where the non-uniqueness of inherited attributes demands an...
Named Instances for Haskell Type Classes Abstract (2008)
Although the functional programming language Haskell has a powerful type class system, users frequently run into situations where they would like to be able to define or adapt instances of type...
Parnas together with a number of colleagues established the systematic use of certain kinds of tables as a useful tool in software documentation and inspection with an accessible, multidimensional...
Second-Order Syntax in HOPS and in RALF (2007)
Wolfram Kahl, Claudia Hattensperger
Abstract HOPS and RALF are two interactive symbol manipulation systems--- one for functional programming and program transformation, the other for proving relation algebraic formulae--- that both...
Total-Single-Pushout Derivations for Internal Graph Attribution (Extended Abstract) (2007)
Abstract:We present a simple, abstract approach that allows to integrate graph attribution into the graph structure itself. We use a declarative setting where the calculation of the attributions...
The pattern matching calculus is a refinement of #-calculus that integrates mechanisms appropriate for fine-grained modelling of non-strict pattern matching. In comparison with the functional...
TERMGRAPH Preliminary Version Inequational Deduction as Term Graph Rewriting 1 (2007)
Andrea Corradini, Fabio Gadducci, Wolfram Kahl
Multi-algebras allow to model nondeterminism in an algebraic framework by interpreting operators as functions from individual arguments to sets of possible results. We propose a simple inequational...
A Domain-Specific Language for the Generation of Optimized SIMD-Parallel Assembly Code (2007)
Christopher Kumar An, Wolfram Kahl
We present a domain-specific language (DSL) embedded into Haskell that allows mathematicians to formulate novel high-performance SIMD-parallel algorithms for the evaluation of special functions....
Bimonadic Semantics for Basic Pattern Matching Calculi (2006)
Wolfram Kahl, Jacques Carette, Xiaoheng Ji
The pattern matching calculi introduced by the first author are a refinement of the λ-calculus that integrates mechanisms appropriate for fine-grained modelling of non-strict pattern matching. While...
Control-flow semantics for assembly-level data-flow graphs (2006)
Wolfram Kahl, Christopher K. An, Jacques Carette
Abstract. As part of a larger project, we have built a declarative assembly language that enables us to specify multiple code paths to compute particular quantities, giving the instruction scheduler...
Christopher Kumar An, Jacques Carette, Wolfram Kahl, Ryan Lortie
Abstract. As part of a larger project, we have built a declarative assembly language. This language enables us to specify multiple code paths to compute particular quantities, giving the instruction...
Compositional Syntax and Semantics of Tables (2003)
Parnas together with a number of colleagues established the systematic use of certain kinds of tables as a useful tool in software documentation and inspection with an accessible, multidimensional...
Basic Pattern Matching Calculi: Syntax, Reduction, Confluence, and Normalisation (2003)
The pattern matching calculus is a refinement of λ-calculus that integrates mechanisms appropriate for fine-grained modelling of non-strict pattern matching. In comparison with the functional...
A relation-algebraic approach to graph structure transformation / (2002)
Literaturverz. S. 153 - 164
Beyond Pretty-Printing: Galley Concepts in Document Formatting Combinators (1999)
Abstract. Galleys have been introduced by Jeff Kingston as one of the key concepts underlying his advanced document formatting system Lout. Although Lout is built on a lazy functional programming...
The Term Graph Programming System HOPS (1999)
Programmers of Haskell or ML know that once their programs are syntactically correct and get past the type checker,the probability that they are correct is usually already pretty high. But while the...
The Term Graph Programming System HOPS (1999)
Programmers of Haskell or ML know that once their programs are syntactically correct and get past the type checker, the probability that they are correct is usually already pretty high. But while the...
The Term Graph Programming System (1999)
t variable binding , explicit variable identity (to denote which nodes stand for the same variables) and metavariables with arbitrary arity. All the problems usually connected with name clashes and...
Beyond Pretty-Printing: Galley Concepts in Document Formatting Combinators (1999)
Abstract. Galleys have been introduced by Jeff Kingston as one of the key concepts underlying his advanced document formatting system Lout. Although Lout is built on a lazy functional programming...
Psychische Faktoren bei Nahrungsmittelallergien / (1998)
Hamburg, Univ., Diss., 1999.
Psychische Faktoren bei Nahrungsmittelallergien [microform] / (1998)
Thesis (doctoral)--Universität Hamburg, 1998.
Relational treatment of term graphs with bound variables (1998)
We show how and why it makes sense to use a relational formalisation instead of the usual functional one in the treatment of term graphs. Special attention is paid to term graphs with bound...
Internally Typed Second-Order Term Graphs (1998)
Abstract. Wepresent a typingconcept for second-order term graphsthat doesnot consider the types as an external add-on, but as an integral part of the term graph structure. This allows a homogeneous...
W.: A Study on Symmetric Quotients (1998)
Bericht Nr, Hitoshi Furusawa, Wolfram Kahl, Wolfram Kahl
Symmetric quotients, introduced in the context of heterogeneous relation algebras, have proven useful for applications comprising for example program semantics and databases. Recently, the increased...
The Higher-Order Programming System User Manual for HOPS Version 0.05 (1998)
Wolfram Kahl, Fakultt Fr Informatik
ly, we speek of document units meaning either toplevel module documents or sections within another unit or submodules located in other units. Toplevel module documents and submodules are modules....
Relational Treatment of Term Graphs With Bound Variables (1998)
We show how and why it makes sense to use a relational formalisation instead of the usual functional one in the treatment of term graphs. Special attention is paid to term graphs with bound...
Algebraic graph derivations for graphical calculi (1997)
Relational formalisations can be very concise and precise and can allow short, calculational proofs under certain circumstances. Examples are can be found in [SS93], and also in the formalisation of...
Wolfram Kahl, Fakultat Fur Informatik
We present a new approach to rewriting obtained by enhancing and unifying existing variants inside the algebraic (or better categorical) approach to (graph) rewriting. Our approach is motivated by...
Wolfram Kahl, Fakultat Fur Informatik
We present a new approach to rewriting obtained by enhancing and unifying existing variants inside the algebraic (or better categorical) approach to (graph) rewriting. Our approach is motivated by...
Algebraische Termgraphersetzung mit gebundenen Variablen / (1996)
Literaturverz. S. 138 - 145.