Lambda the Ultimate

type	title	author	last post
Story	The Trouble with Erlang Scalability require massive concurrency, not just parallelism by Hewitt	Charles Stewart	2011-10-14 03:57
Forum topic	Yield : Mainstream Delimited Continuations; "yield" from different languages compared and formalized It is preferable to use futures instead of "yield" by Hewitt	gasche	2011-09-12 01:22
Forum topic	Strange Loop 2011 - Languages galore "Strange Loop" should be credited to Doug Hofstadter by Hewitt	puredanger	2011-06-29 00:10
Forum topic	Middle History of Logic Programming Udated version by Hewitt Compile time = wait time till program is executable by Hewitt C++ header file slowness incented development of Google Go by Hewitt Compile time = wait time till programmer input is executable by Hewitt Type inference in linear time should be a requirement by Hewitt A modern programming language ought to compile in linear time by Hewitt Many-core concurrency has supplanted backtracking by Hewitt Logic Programming is a currently being neglected by Hewitt Kowalski given IJCAI-11 Award for Research Excellence by Hewitt	Hewitt	2011-06-28 02:49
Story	Memory Models: A Case for Rethinking Parallel Languages and Hardware, CACM, August 2010 Transactional memory doesn't help the manycores by Hewitt Compare and Swap is not the answer by Hewitt Causal consistency is the answer to the memory model conundrum by Hewitt	Z-Bo	2011-03-14 05:47
Story	Tractatus Digito-Philosophicus Gödel versus Wittgenstein by Hewitt Language Games by Hewitt Turing versus Wittgenstein by Hewitt	Manuel J. Simoni	2011-03-12 23:35
Forum topic	Monads vs. Actors Don't be discouraged by Hewitt Interaction *creates* reality! by Hewitt The mail must go through! by Hewitt Nice quote! by Hewitt Arbiters are one possible source of unbounded nondeterminism by Hewitt The big picture by Hewitt Computational Representation Theorem by Hewitt Simple Actor system that computes an unbounded integer by Hewitt Kuhn was great! by Hewitt A NDTM cannot implement unbounded nondeterminism by Hewitt ...	Sean McDirmid	2011-03-02 21:15
Forum topic	What is computation? Concurrency versus Turing's Model Actors are computationally more powerful than NDTMs by Hewitt A Nondeterministic Turing Machine has bounded nondetermiminism by Hewitt Computatonal Representation Theorem by Hewitt ActorScript has types that are Actors by Hewitt Strictly speaking, Actor computations are partial orders by Hewitt Infinite strings not needed; just infinite set of finite strings by Hewitt Actor Model Proof Theory by Hewitt Dodging the fairness bullet by Hewitt The Actor system always halts but the NDTM doesn't by Hewitt Finite traces have limitatins analogous to finite state machines by Hewitt ...	Hewitt	2011-02-22 13:52
Forum topic	What is an Actor? ActorScript is a very simple programming language by Hewitt Producedure calling is *not* faster than message passing by Hewitt	Hewitt	2011-02-21 02:34
Forum topic	How to Program the Many Cores for Inconsistency Robustness Slides are available for the video by Hewitt Nondeterministic Turing Machine by Hewitt Excellent suggestion! by Hewitt	Hewitt	2011-02-03 14:26
Forum topic	Tolerant vs. Demanding Software Timing dependent preconditions are the norm by Hewitt Preconditions can be timing dependent by Hewitt	kclancy	2010-12-30 04:44
Forum topic	Lambda the Ultimate seems an Overstatement (not) Computatonal Representation Theorem by Hewitt Independent shared resources cannot be implemented by monads by Hewitt Transactional memory doesn't scale and has lots of loose ends by Hewitt Modularity and concurrency plus a lot more by Hewitt Recording history is not the same as operating in the present by Hewitt Sorry about that by Hewitt Users of a shared account not controlled by each other by Hewitt Monads force sequencing because you have to get the state back by Hewitt Monads force sequencing by Hewitt Monads don't work for concurrency by Hewitt	Ed Earl Ross	2010-12-13 19:44
Forum topic	Inconsistency Robustness 2011 at Stanford Perpetual, pervasive inconsistency by Hewitt Inconsistency Robustness is not limited to belief revision by Hewitt	Hewitt	2010-12-07 14:15
Forum topic	Incompleteness Theorems: The Logical Necessity of Inconsistency Validity of arguments is recursively decidable in Direct Logic by Hewitt Validity of arguments is recursively decidable in Direct Logic by Hewitt Practical payoff is in larger systems by Hewitt Inconsistency Recursively Undecidable for *Classes* of theories by Hewitt Recursive Undecidability follows from High Expressiveness by Hewitt Inconsistency is Recursively Undecidable by Hewitt So far, only proof theory for Direct Logic by Hewitt Catch-22 in Direct Logic by Hewitt Video of Stanford Logic Colloquium on Direct Logic by Hewitt A larger task by Hewitt	Hewitt	2010-08-10 14:23
Forum topic	splitting the program into formalizable vs. non-formalizable parts? There is more to computation than (recursive) functions by Hewitt	raould	2010-04-17 03:48
Forum topic	Incompleteness Theorems: The Logical Necessity of Inconsistency Relevance Logic versus Direct Logic by Hewitt	Hewitt	2010-04-02 03:25
first page previous page next page last page

---

Logs: Hack The Planet ; JavaLobby ; Daily Python-URL ; Daily WTF ; PHP everywhere ; (more)
Wikis: WikiWiki ; Erlang ; Common Lisp ; Haskell ; Squeak ; Tcl ; Program Transformation