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 | 4520 reads
|
Browse archivesActive forum topics |
Recent comments
6 days 6 min ago
1 week 2 days ago
6 weeks 3 days ago
6 weeks 4 days ago
18 weeks 4 days ago
18 weeks 5 days ago
18 weeks 6 days ago
18 weeks 6 days ago
19 weeks 4 days ago
19 weeks 4 days ago