Browse thread
[Caml-list] Formal Methods
[
Home
]
[ Index:
by date
|
by threads
]
[ Message by date: previous | next ] [ Message in thread: previous | next ] [ Thread: previous | next ]
[ Message by date: previous | next ] [ Message in thread: previous | next ] [ Thread: previous | next ]
| Date: | -- (:) |
| From: | Martin Berger <martinb@d...> |
| Subject: | Re: [Caml-list] Formal Methods |
> The real difficulties in proving functional code appear when > side-effects are mixed with powerful features such as polymorphism or > higher-order. Then it becomes very hard to reason about programs. > Actually, we don't even have a specification language to write > programs properties to be proved. There is a nice challenge for > research here. this has changed recently. please consider http://www.doc.ic.ac.uk/~yoshida/paper/PA.ps http://www.doc.ic.ac.uk/~yoshida/paper/polyrec.ps http://www.doc.ic.ac.uk/~yoshida/paper/icfp04.ps more along those lines is in the pipeline. martin ------------------- To unsubscribe, mail caml-list-request@inria.fr Archives: http://caml.inria.fr Bug reports: http://caml.inria.fr/bin/caml-bugs FAQ: http://caml.inria.fr/FAQ/ Beginner's list: http://groups.yahoo.com/group/ocaml_beginners