Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
Finite State Machines in Forth (1994)
(
forth.org
)
85 points
by
ofalkaed
1 day ago
|
hide
|
past
|
favorite
|
3 comments
help
eru
21 hours ago
|
next
[–]
Compare 'Lambda: the ultimate GOTO'
https://www2.cs.sfu.ca/CourseCentral/383/havens/pubs/lambda-...
which also uses state machines as its motivating example.
reply
lkuty
13 hours ago
|
parent
|
next
[–]
With TCO, a state transition is implemented just as a function call. I find it very elegant and see TCO as great bonus in programming languages.
reply
madhadron
1 day ago
|
prev
[–]
I haven't thought about this in years! Julian Noble was one of my teachers back when I was an undergrad.
reply
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search:
reply