Difference between pages "Mathematical Extensions" and "Help:Assigning permissions"

From Event-B
(Difference between pages)
Jump to navigationJump to search
imported>Nicolas
 
(yiInRYSih)
 
Line 1: Line 1:
Currently the operators and basic predicates of the Event-B mathematical language supported by Rodin are fixed.
+
comment2, http://xpahcgoo.p2web.biz/horse6286.html horse, suprgp, http://xpahcgoo.110mb.com/horse982.html horse,  =-), http://xpahcgoo.sitebooth.com/for2183.html for,  bqjd, http://xpahcgoo.p2web.biz/free6118.html free,  520248, http://xpahcgoo.seitenclique.net/horse8953.html horse, >:-[[, http://xpahcgoo.p2web.biz/free2529.html free, vpjx, http://xpahcgoo.freehostingz.com/free5189.html free,  fmzuc, http://xpahcgoo.freewhost.com/free54.html free,  91047, http://xpahcgoo.hostmo.com/free1678.html free,  11004, http://xpahcgoo.seitenclique.net/free4294.html free,  %-D,
We propose to extend Rodin to support user-defined data types and associated operators including
 
inductive data typesUsers will be able to define operators of
 
polymorphic type as well as parameterised predicate definitions.
 
 
 
Details of the proposal may be found in this report : [http://deploy-eprints.ecs.soton.ac.uk/80 Proposals for Mathematical Extensions for Event-B]
 
 
 
The proposal consists of considering three kinds of extension:
 
 
 
# Extensions of set-theoretic expressions or predicates: example extensions of this kind consist of adding the transitive closure of relations or various ordered relations.
 
# Extensions of the library of theorems for predicates and operators.
 
# Extensions of the Set Theory itself through the definition of algebraic types such as  lists or ordered trees using new set constructors.
 
 
 
 
 
== Towards a generic AST ==
 
 
 
The following AST parts are to become generic, or at least parameterised:
 
* Lexer
 
* [[Constrained Dynamic Parser|Parser]]
 
* Nodes ( Formula class hierarchy ): parameters needed for:
 
** Type Solve (type rule needed to synthesize the type)
 
** Type Check (type rule needed to verify constraints on children types)
 
** WD (WD predicate)
 
** PrettyPrint (tag image + notation (prefix, infix, postfix))
 
** Visit Formula (getting children + visitor callback mechanism)
 
** Rewrite Formula (associative formulæ have a specific flattening treatment)
 
* Types (Type class hierarchy): parameters needed for:
 
** Building the type expression (type rule needed)
 
** PrettyPrint (set operator image)
 
** getting Base / Source / Target type (type rule needed)
 
* Formula Factory
 
 
 
== Impact on other tools ==
 
 
 
Impacted plug-ins (use a factory to build formulæ):
 
* org.eventb.core
 
* org.eventb.core.seqprover
 
* org.eventb.pp
 
* org.eventb.pptrans
 
* org.eventb.ui
 
 
 
 
 
[[Category:Design proposal]]
 

Revision as of 07:57, 10 August 2008