Wolfgang Gehrke

  • Citations Per Year
Learn More
We present a canonical system for comonads which can be extended to the notion of a computational comonad BG92] where the crucial point is to nd an appropriate representation. These canonical systems are checked with the help of the Larch Prover GG91] exploiting a method by G. Huet Hue90a] to represent typing within an untyped rewriting system. The(More)
The category of noncommutative geometric spaces is a rather new and wide field in geometry that provides a rich source of hard computer applications. In this contribution we give a short summary of the basic notions of geometric spaces. The so-called parallel map that describes a space will play a fundamental role because, in terms of the parallel map, a(More)
Recent work investigates the combination of Computer Algebra Systems and Automated Theorem Provers We elaborate a concrete example the generic construction of complex numbers quaternions Cayley numbers on top of real numbers The implementation is done by a functor in the programming language SML which can be instantiated to perform the algebraic(More)
We report on an extension of the SML implementation of the logic programming language Elf Pfe to support the check of convergence for higher order critical pairs Since Elf is based on the Edinburgh Logical Framework HHP it utilizes dependent types Therefore in the implementation a generalization of the critical pair lemma to this case as done in Vir had to(More)
This paper shows the expressive power of the functional programming language Standard ML (SML) in the context of computer algebra. It is focused on a special application of the p-adic lifting technique, the Hensel algorithm, that is utilized in a symbolic but also numeric context. This experiment demonstrates that SML provides a suitable frame for the(More)
This paper shows the expressive power of the functional programming language Standard ML SML in the context of computer algebra It is focused on a special application of the p adic lifting technique the Hensel algorithm that is utilized in a symbolic but also numeric context This experiment demonstrates that SML provides a suitable frame for the(More)
We report on an extension of the SML implementation of the logic programming language Elf [Pfe94] to support the check of convergence for higher-order critical pairs. Since Elf is based on the Edinburgh Logical Framework [HHP93] it utilizes dependent types. Therefore in the implementation a generalization of the critical pair lemma to this case as done in(More)
  • 1