Return-Path: no-reply@arXiv.org
Delivery-Date: Tue Feb 17 22:50:05 2009
Date: Tue, 17 Feb 2009 16:45:41 -0500
Message-Id: <200902172145.n1HLjfYA000363@arxiv1.library.cornell.edu>
From: no-reply@arXiv.org
To: wirth@logic.at
Subject: Your arXiv submission 0902.2997 moved to 0902.2995
Reply-To: www-admin@arXiv.org

Your arXiv submission 0902.2997 has been moved to 0902.2995.

Please save this message for future reference, it supercedes the earlier 
message RE 0902.2997. Please also forward to any collaborators whom you had
forwarded the earlier message.

You may now access your paper at: http://arXiv.org/abs/0902.2995

The metadata stored for your paper is:
------------------------------------------------------------------------------
\\
arXiv:0902.2995
From: Claus-Peter Wirth <wirth@logic.at>
Date: Tue, 17 Feb 2009 20:52:11 GMT   (47kb)

Title: ASF+ --- eine ASF-aehnliche Spezifikationssprache
Authors: Ruediger Lunde, Claus-Peter Wirth
Categories: cs.AI cs.SC
Comments: iv + 58 pages
Report-no: SEKI Working-Paper SWP-94-05
License: http://creativecommons.org/licenses/by/3.0/
\\
  Maintaining the main aspects of the algebraic specification language ASF as
presented in [Bergstra&al.89] we have extend ASF with the following concepts:
While once exported names in ASF must stay visible up to the top the module
hierarchy, ASF+ permits a more sophisticated hiding of signature names. The
erroneous merging of distinct structures that occurs when importing different
actualizations of the same parameterized module in ASF is avoided in ASF+ by a
more adequate form of parameter binding. The new ``Namensraum''-concept of ASF+
permits the specifier on the one hand directly to identify the origin of hidden
names and on the other to decide whether an imported module is only to be
accessed or whether an important property of it is to be modified. In the first
case he can access one single globally provided version; in the second he has
to import a copy of the module. Finally ASF+ permits semantic conditions on
parameters and the specification of tasks for a theorem prover.
\\