Timeline for Automatic proofs or model checking in an extremely simplified functional language
Current License: CC BY-SA 3.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 12, 2012 at 14:49 | comment | added | Andrej Bauer | Your language is commonly known as PCF, see en.wikipedia.org/wiki/Programming_Computable_Functions. It is Turing complete so there is no chance that its theory were decidable. | |
| Feb 11, 2012 at 22:19 | answer | added | Anthony | timeline score: 3 | |
| Jan 29, 2012 at 10:55 | vote | accept | user7610 | ||
| Jan 27, 2012 at 19:44 | history | edited | Sam Tobin-Hochstadt |
edited tags
|
|
| Jan 27, 2012 at 19:43 | answer | added | Sam Tobin-Hochstadt | timeline score: 8 | |
| Jan 27, 2012 at 18:25 | answer | added | Samuel Duclos | timeline score: -6 | |
| Jan 27, 2012 at 14:08 | history | asked | user7610 | CC BY-SA 3.0 |