User loginNavigation |
Reasoning with inductive typesModern Eiffel is a new language which is syntactically based on Eiffel but has a lot of concepts of functional languages like Haskell, OCaml or Coq. Modern Eiffel puts the emphasis on static verification, i.e. a compiler can statically check that a programm written in Modern Eiffel meets its specification. The following article describes how Modern Eiffel's proof engine can be used to reason with inductive types. By hbrandl at 2012-03-08 20:32 | LtU Forum | previous forum topic | next forum topic | other blogs | 4414 reads
|
Browse archives
Active forum topics |
Recent comments
1 hour 45 min ago
2 hours 32 sec ago
5 days 2 hours ago
5 days 3 hours ago
5 days 3 hours ago
3 weeks 5 days ago
4 weeks 4 days ago
4 weeks 4 days ago
4 weeks 5 days ago
4 weeks 5 days ago