home *** CD-ROM | disk | FTP | other *** search
- Newsgroups: comp.theory
- Path: sparky!uunet!charon.amdahl.com!amdahl!rtech!sgiblab!darwin.sura.net!newsserver.jvnc.net!gmd.de!Germany.EU.net!mcsun!julienas!ensmp!font.ensmp.fr!bazet
- From: bazet@chailly.ensmp.fr (Philippe BAZET)
- Subject: Adding Constraints to Automate Programming
- Message-ID: <BAZET.93Jan27195118@chailly.ensmp.fr>
- Sender: news@ensmp.fr
- Organization: /home/users/bazet/.organization
- Distribution: comp
- Date: 27 Jan 93 19:51:18
- Lines: 25
-
- Hi net,
-
-
- Let us consider a circular list. It can be defined by an ML-like data
- type such as
-
- list 'a = nil | cons of 'a * list 'a ;
-
- and the assertion:
-
- The last element for the list is the first one.
-
- Does anyone know of programming systems in which such assertions can be
- expressed formally and used at either run-time or compile-time? I know
- of Ait Kaci's LIFE which is mainly restricted to local structure
- constraints.
-
- Thanks in advance,
- Philippe Bazet.
- e-mail: bazet@cri.ensmp.fr
-
-
-
-
-
-