TE
TechEcho
Home24h TopNewestBestAskShowJobs
GitHubTwitter
Home

TechEcho

A tech news platform built with Next.js, providing global tech news and discussions.

GitHubTwitter

Home

HomeNewestBestAskShowJobs

Resources

HackerNews APIOriginal HackerNewsNext.js

© 2025 TechEcho. All rights reserved.

Declarative Computation, Syntactic Sugar, and the Abstract Machine

31 pointsby mrbbkalmost 12 years ago

2 comments

mrbbkalmost 12 years ago
Also part of a series.<p>Chapter 01: <a href="http:&#x2F;&#x2F;michaelrbernste.in&#x2F;2013&#x2F;02&#x2F;19&#x2F;CTM-chapter-01.html" rel="nofollow">http:&#x2F;&#x2F;michaelrbernste.in&#x2F;2013&#x2F;02&#x2F;19&#x2F;CTM-chapter-01.html</a><p>On the paper that sums up the pedagogy: <a href="http:&#x2F;&#x2F;michaelrbernste.in&#x2F;2013&#x2F;02&#x2F;23&#x2F;notes-on-teaching-with-the-kernel-language-approach.html" rel="nofollow">http:&#x2F;&#x2F;michaelrbernste.in&#x2F;2013&#x2F;02&#x2F;23&#x2F;notes-on-teaching-with-...</a>
aufreak3almost 12 years ago
Oz (the language presented in this article) is a language worth learning also for the unique way it formulates concurrency. Concurrent processes are coordinated through variables being realized - i.e. a process that requires a variable to be bound will block at the point it is required and when another process causes the variable to become bound, it will proceed. Its constraint programming facilities can be expressed very nicely using these constructs.
评论 #5895419 未加载