Timeline for Is there a math theory or a model behind programming languages design
Current License: CC BY-SA 3.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 15, 2013 at 21:01 | review | First posts | |||
| Dec 15, 2013 at 23:27 | |||||
| Nov 22, 2013 at 17:32 | history | edited | Filip Malczak | CC BY-SA 3.0 |
added 284 characters in body
|
| Nov 22, 2013 at 11:21 | comment | added | SK-logic | Lambda calculus and turing machine are equivalent, and both are just specific term-rewriting systems. And imperative languages semantics is normally defined with lambda calculus (or, a more generic TRS), not with Turing machine. Turing machine is only useful for reasoning about algorithms complexity, but it's a totally inadequate tool for defining languages. For example of an imperative language formal definition, see this: code.google.com/p/c-semantics | |
| Nov 22, 2013 at 11:03 | vote | accept | Moha the almighty camel | ||
| Nov 22, 2013 at 11:01 | history | edited | Filip Malczak | CC BY-SA 3.0 |
deleted 1 characters in body
|
| Nov 22, 2013 at 10:40 | history | answered | Filip Malczak | CC BY-SA 3.0 |