Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
seliopou
on July 16, 2014
|
parent
|
context
|
favorite
| on:
Why We Use OCaml
For (actual) programming languages without mutation and with more than just lambdas and application for control flow, it is right:
f x y = y f (raise Done) Ω
Under lazy application semantics this program will never terminate. Under eager application semantics it will.
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search: