[racket] users Digest, Vol 77, Issue 68

Thanks for your answer.

David.
Le 19 janv. 2012 à 18:00, users-request at racket-lang.org a écrit :

> Send users mailing list submissions to
> 	users at racket-lang.org
> 
> To subscribe or unsubscribe via the World Wide Web, visit
> 	http://lists.racket-lang.org/users/listinfo
> or, via email, send a message with subject or body 'help' to
> 	users-request at racket-lang.org
> 
> You can reach the person managing the list at
> 	users-owner at racket-lang.org
> 
> When replying, please edit your Subject line so it is more specific
> than "Re: Contents of users digest..."
> 
> 
> [Racket Users list:
> http://lists.racket-lang.org/users]
> 
> 
> Today's Topics:
> 
>   1. Re: Symbolic expression, reduction, equivalence, ....
>      (Robby Findler)
>   2. class variables in racket (Christian Wagenknecht)
> 
> 
> ----------------------------------------------------------------------
> 
> Message: 1
> Date: Thu, 19 Jan 2012 09:12:36 -0600
> From: Robby Findler <robby at eecs.northwestern.edu>
> To: Matthias Felleisen <matthias at ccs.neu.edu>
> Cc: David Delfieu <david.delfieu at univ-nantes.fr>,
> 	users at racket-lang.org
> Subject: Re: [racket] Symbolic expression, reduction, equivalence,
> 	....
> Message-ID:
> 	<CAL3TdOPeqNc68Z+L062xYzL-wAyfKF3yQ=pTJZ_KACUd477W5A at mail.gmail.com>
> Content-Type: text/plain; charset=UTF-8
> 
> Redex should work well if you're experimenting with not too large
> formulas. If you need to reduce huge formulas, you will probably be
> better off prototyping in Redex and then porting to Racket itself,
> using a datastructure that helps you efficiently manipulate the
> formulas.
> 
> Robby
> 
> On Thu, Jan 19, 2012 at 8:28 AM, Matthias Felleisen
> <matthias at ccs.neu.edu> wrote:
>> 
>> Have you looked at Redex? -- Matthias
>> 
>> 
>> 
>> On Jan 19, 2012, at 9:06 AM, David Delfieu wrote:
>> 
>>> Hello
>>> 
>>> I am defining a new algebra with internal compositional laws over symbolic elements.
>>> 
>>> After the definition of the properties of the operators, I would to express well formed formula (wff) in that algebra, which are symbolic expression :
>>> (e1 \oplus e2) \perp e3 ? : for example.
>>> 
>>> I would like to apply theorem reductions on theses wff, pattern matching, and prove that reduced expressions are equivalent.
>>> 
>>> Could you suggest a package which could bring me some interesting functions ?
>>> 
>>> What type of structure could you suggest me to store a wff :
>>> mlist, vector, sets, ...
>>> 
>>> Best regards, David.
>>> 
>>> *******************************************************
>>> David Delfieu, tel : 02 40 90 50 45
>>> EC ? Polytech'Nantes - D?partement G?nie ?lectrique
>>> Site de Gavy, 44603 Saint Nazaire Cedex
>>> Chercheur ? L'IRCCyN
>>> *******************************************************
>>> 
>>> 
>>> ____________________
>>> ?Racket Users list:
>>> ?http://lists.racket-lang.org/users
>> 
>> 
>> ____________________
>> ?Racket Users list:
>> ?http://lists.racket-lang.org/users
> 
> 
> 
> ------------------------------
> 
> Message: 2
> Date: Thu, 19 Jan 2012 17:57:24 +0100
> From: Christian Wagenknecht <c.wagenknecht at hs-zigr.de>
> To: users at racket-lang.org
> Subject: [racket] class variables in racket
> Message-ID: <4F184B74.9030208 at hs-zigr.de>
> Content-Type: text/plain; charset=ISO-8859-15; format=flowed
> 
> How class variables/methods (instead of instance variables/methods) can be implemented be means of Racket's class definition expressions? An unsatisfying way I found is by using a let expression enclosing the whole definition of the class.
> 
> 
> End of users Digest, Vol 77, Issue 68
> *************************************

Respectueusement, 

*******************************************************
David Delfieu, tel : 02 40 90 50 45			
EC à Polytech'Nantes - Département Génie Électrique 
Site de Gavy, 44603 Saint Nazaire Cedex		
Chercheur à L'IRCCyN						
*******************************************************