Posts By: bdenckla
Date | Post | Topic |
10/13/2011 | machine-ported reference algorithms | machine-ported reference algorithms |
10/04/2011 | What space does SQL cover, or, why is max so weird in SQL? | What space does SQL cover, or, why is max so weird in SQL? |
10/04/2011 | What happened to SEAM | Redesigning the Mozart virtual machine |
04/27/2010 | unit delay operator | Add "unit time delay (D)" operator to functional language with random signals instead of random vars |
09/14/2011 | My enthusiastic support, for whatever that's worth | Computing Needs Time |
06/17/2008 | check out AT&T GraphViz dot | Program Visualization: Flowchart Layout Algorithms? |
06/01/2008 | what a type system always proves vs. what it can be made to prove | what a type system always proves vs. what it can be made to prove |
06/01/2008 | thanks | what a type system always proves vs. what it can be made to prove |
06/09/2008 | progress report | what a type system always proves vs. what it can be made to prove |
06/10/2008 | I think you get it | what a type system always proves vs. what it can be made to prove |
03/20/2006 | sublanguages of CTM's Oz | sublanguages of CTM's Oz |
03/20/2006 | memoization | sublanguages of CTM's Oz |
01/19/2006 | Sequentiality, laziness, Haskell, and cyclic block diagrams | Sequentiality, laziness, Haskell, and cyclic block diagrams |
01/07/2006 | Comments on "The essence of dataflow programming" | The new old or The "Return" to Concurrency |
01/09/2006 | Draft of "Another Essence of Dataflow Programming" | The new old or The "Return" to Concurrency |
01/09/2006 | yes that's me | The new old or The "Return" to Concurrency |
01/10/2006 | thanks for link to McBride & Paterson paper | The new old or The "Return" to Concurrency |
11/03/2005 | A + b * c in Brian Meek's "The static semantics file" | A + b * c in Brian Meek's "The static semantics file" |
11/04/2005 | VW grammars | A + b * c in Brian Meek's "The static semantics file" |
10/14/2005 | Translational vs. denotational semantics | Translational vs. denotational semantics |
10/07/2005 | Literature on commutative lifted boolean operators | Literature on commutative lifted boolean operators |
01/11/2006 | Here's my critique of this paper | The essence of Dataflow Programming by Tarmo Uustalu and Varmo Vene |
01/12/2006 | Why AF better than comonad in capturing dataflow semantics | The essence of Dataflow Programming by Tarmo Uustalu and Varmo Vene |
06/26/2005 | "dynamic" generative programming? | "dynamic" generative programming? |
06/28/2005 | I think I found my problem | "dynamic" generative programming? |
06/28/2005 | Similar languages? | "dynamic" generative programming? |
06/28/2005 | Templates look legit | "dynamic" generative programming? |
06/30/2005 | codegen beyond Cpre | "dynamic" generative programming? |
06/23/2005 | "applicative" vs."functional" | "applicative" vs."functional" |
03/23/2005 | Post new comment vs. reply | Post new comment vs. reply |
03/22/2005 | Speed and semantics in CTM Chap. 1 | Speed and semantics in CTM Chap. 1 |
03/22/2005 | Are "Optimizations" always better? | Speed and semantics in CTM Chap. 1 |
03/22/2005 | Decidability a problem? | Speed and semantics in CTM Chap. 1 |
03/22/2005 | One other thing | Speed and semantics in CTM Chap. 1 |
03/23/2005 | Thanks for your reply (pointer) | Speed and semantics in CTM Chap. 1 |
03/23/2005 | Thanks for your reply | Speed and semantics in CTM Chap. 1 |
03/09/2005 | Exploiting parser ambiguity | Exploiting parser ambiguity |
03/09/2005 | Implementing "overlapping reference" as sugar | Exploiting parser ambiguity |
03/10/2005 | Terminology clarification | Exploiting parser ambiguity |
03/10/2005 | Can parser produce ASG? | Exploiting parser ambiguity |
03/09/2005 | Reframing the problem in terms of classes of grammars | Exploiting parser ambiguity |
03/10/2005 | Regexps enough? | Exploiting parser ambiguity |
03/10/2005 | Surprisingly judgemental response | Exploiting parser ambiguity |
03/11/2005 | First stab at a (more) formal semantics | Exploiting parser ambiguity |
03/11/2005 | Some answers | Exploiting parser ambiguity |
03/11/2005 | A more complicated example sometimes helps | Exploiting parser ambiguity |
03/12/2005 | Oh, yeah, the meaning of this new example | Exploiting parser ambiguity |
03/12/2005 | Block evaluation | Exploiting parser ambiguity |
03/12/2005 | ordering (set-to-tuple conversion) | Exploiting parser ambiguity |
03/12/2005 | compositional languages | Exploiting parser ambiguity |
03/10/2005 | Denotational semantics for a block diagram language | Exploiting parser ambiguity |
03/10/2005 | Why I can't bracket "b = f a" | Exploiting parser ambiguity |
03/10/2005 | Here are some links to graphs that might clarify things | Exploiting parser ambiguity |
03/10/2005 | Why I can't bracket "b = f a" | Exploiting parser ambiguity |
03/10/2005 | I already know the semantics of my language | Exploiting parser ambiguity |
03/11/2005 | The semantics | Exploiting parser ambiguity |
03/11/2005 | The language needs laziness | Exploiting parser ambiguity |
LtU Topic Index Sorted by Date | LtU Topic Index Sorted by Topic | LtU Index of Post Authors | Zipped LtU Archive |