Language Proposal

Authors

Title

Status, Abstract

Gunther Schmidt

A Proposal for a Multilevel Relational Reference Language
.pdf .bib

JoRMiCS 1 (2004) 314-338
the new

Electronic Journal on Relational Methods in Computer Science

Department of Computing Science
University of the Federal Armed Forces Munich
85577 Neubiberg, Germany
Gunther.Schmidt@unibw.de
September 2004 A highly expressive multilevel relational reference language is proposed that covers most possibilities to use relations in practical applications. The language is designed to describe work in a heterogeneous setting. It originated from a Haskell-based system announced in the decomposing paper, forerunners of which was RALF.
This language is intended to serve a variety of purposes. First, it shall allow to formulate all of the problems that have so far been tackled using relational methods providing full syntax- and type-control. Transformation of relational terms and formulae in the broadest sense shall be possible as well as interpretation in many forms. In the most simple way, boolean matrices will serve as an interpretation, but also non-representable models as with the RATH-system may be used. Proofs of relational formulae in the style of RALF or in Rasiowa-Sikorski style are aimed at.

Authors	Title	Status, Abstract
Gunther Schmidt	A Proposal for a Multilevel Relational Reference Language .pdf .bib	JoRMiCS 1 (2004) 314-338 the new Electronic Journal on Relational Methods in Computer Science
Department of Computing Science University of the Federal Armed Forces Munich 85577 Neubiberg, Germany Gunther.Schmidt@unibw.de	September 2004	A highly expressive multilevel relational reference language is proposed that covers most possibilities to use relations in practical applications. The language is designed to describe work in a heterogeneous setting. It originated from a Haskell-based system announced in the decomposing paper, forerunners of which was RALF. This language is intended to serve a variety of purposes. First, it shall allow to formulate all of the problems that have so far been tackled using relational methods providing full syntax- and type-control. Transformation of relational terms and formulae in the broadest sense shall be possible as well as interpretation in many forms. In the most simple way, boolean matrices will serve as an interpretation, but also non-representable models as with the RATH-system may be used. Proofs of relational formulae in the style of RALF or in Rasiowa-Sikorski style are aimed at.