Accession Number : ADA288582

Title :   Problems in Rewriting Applied to Categorical Concepts by the Example of a Computational Comonad.

Descriptive Note : Research rept.,

Corporate Author : CARNEGIE-MELLON UNIV PITTSBURGH PA SCHOOL OF COMPUTER SCIENCE

Personal Author(s) : Gehrke, Wolfgang

PDF Url : ADA288582

Report Date : OCT 1994

Pagination or Media Count : 18

Abstract : We present a canonical system for comonads which can be extended to the notion of a computational comonad (BG91) where the crucial point is to find 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 resulting decision procedures are implemented in the programming language Elf Pfe89j since typing is directly supported by this language. Finally we outline an incomplete attempt to solve the problem which could be used as a benchmark for rewriting tools.

Descriptors :   *COMPUTER PROGRAMMING, COMPUTATIONS, DECISION MAKING, PROGRAMMING LANGUAGES, PROBLEM SOLVING.

Subject Categories : Computer Programming and Software

Distribution Statement : APPROVED FOR PUBLIC RELEASE