Posts By: Peter A Jonsson
| Date | Post | Topic |
| 09/21/2011 | No real gain? | What needs to be done? |
| 05/16/2011 | Very cool! | In search of inspiration |
| 05/16/2011 | I'd like to echo Chad | One Pass Real-Time Generational Mark-Sweep Garbage Collection |
| 05/16/2011 | ..benefit in any language | One Pass Real-Time Generational Mark-Sweep Garbage Collection |
| 03/14/2011 | Beta-reduction | Strict data constructors + non-strict application? |
| 03/16/2011 | If your optimizer can detect | Strict data constructors + non-strict application? |
| 03/14/2011 | Full-beta reduction is | Strict data constructors + non-strict application? |
| 01/16/2011 | A few pointers | Parametric Prediction of Heap Memory Requirements |
| 01/08/2011 | Typed IR | The AST Typing Problem |
| 01/16/2011 | Avoiding non-termination | The AST Typing Problem |
| 12/28/2010 | Bolting on type systems | Prototyping a new language with Haskell |
| 10/11/2010 | Purity does not require lazy evaluation | Design Principles Behind Smalltalk |
| 09/01/2010 | Slightly updated version | Abstract interpreters for free |
| 02/15/2010 | I'm not sure I understand | Mutable objects with monadic methods |
| 12/21/2009 | Detecting non-termination | Chunked sequences: Lookahead laziness |
| 11/22/2009 | Performance | John Hughes on Erlang and Haskell |
| 08/17/2009 | Examples of recursive programming techniques | The End of the GPU Roadmap |
| 03/13/2009 | Optimization by equality | Advantages of pointfree? |
| 03/04/2009 | Nice! | Equality Saturation: A New Approach to Optimization |
| 01/12/2009 | Monads in strict languages | Monads = lazy, effect types = strict? |
| 12/15/2008 | Program specialization | Practicality of Exclusively Compiler-Driven Unboxing |
| 10/02/2008 | Not so tagless. | Lazy Graph Reduction and abstract machines |
| 09/17/2008 | Real-Time GC | Twilight of the GPU |
| 07/14/2008 | There is atleast one more | Catch me if you can: Towards type-safe, hierarchical, lightweight, polymorphic and efficient error management in OCaml |
| 03/16/2008 | Implementation techniques for first-class functions? | Higher-Order Programming without Closures? |
| 02/07/2008 | Timed pi calculus | time as a first class value? |
| 09/27/2007 | Reduceron | FPGA CPUs |
| 09/13/2007 | Totality Checker for Haskell | Extending HM type inference -- would this be possible? Or even desirable? |
| 07/28/2007 | Testing first year programming students | Testing first year programming students |
| 07/18/2007 | Erlang's history and design choices | Whoever does not understand LISP, is doomed to reinvent it. |
| 07/19/2007 | My claim was that research | Whoever does not understand LISP, is doomed to reinvent it. |
| 06/01/2007 | Deforesting strict languages | "Practical" advantages of lazy evaluation |
| 05/04/2007 | Previous threads. | Functional Object-Oriented Programming |
| 04/20/2007 | Bounded Buffers | Actors vs. Reactive Objects |
| 03/08/2007 | Timber | Lightweight static resources |
| 02/15/2007 | Call-by-value | Lightweight Fusion by Fixed Point Promotion |
| 03/04/2007 | GC | Patrick Logan on Software Transaction Memory |
| 01/10/2007 | Commercial Users of Functional Programming | Why people don't use functional programming? |
| 02/08/2007 | Mapreduce - revisited. | Why people don't use functional programming? |
| 02/08/2007 | Data Parallel Haskell and | Why people don't use functional programming? |
| 02/28/2007 | This is definitely not my | Why people don't use functional programming? |
| 12/03/2006 | Simon Peyton Jones has some | How to write a Programming Language Paper? |
| 11/27/2006 | A Complete, Co-Inductive Syntactic Theory of Sequential Control and State. | A Complete, Co-Inductive Syntactic Theory of Sequential Control and State. |
| 11/28/2006 | Adoption of FP. | The Future of LtU |
| 11/29/2006 | The focus is on pure | The Future of LtU |
| 07/18/2007 | Huh? | Dodo |
| 10/18/2006 | Virtual memory/Swap | Good Ideas, Through the Looking Glass |
| 06/12/2006 | Formal verification of a C-Compiler frontend. | Formal verification of a C-Compiler frontend. |
| 05/07/2006 | Is this what you are looking | A Hacker's Introduction to Partial Evaluation |
| 05/06/2006 | If it can be proven | Patterns of Integer Usage |
| 05/03/2006 | Book about PE. | What do you believe about Programming Languages (that you can't prove (yet))? |
| 05/06/2006 | Supercompilers LLC | What do you believe about Programming Languages (that you can't prove (yet))? |
| 03/29/2006 | O'Haskell might be a | Type Inference in Object Oriented Languages |
| 02/03/2006 | Type inference and scaling. | The Next Mainstream Programming Languages |
| 02/04/2006 | Incomprihensible error messages | The Next Mainstream Programming Languages |
| 02/01/2006 | Terminology | U, a small model |
| 01/19/2006 | Compiler size. | Scala 2 |
| 11/09/2005 | Oversimplified web browser. | Type Nomenclature |
| 08/11/2006 | Purely Functional Languages | Object Oriented Programming + Referential Transparency |
| 09/21/2005 | Performance, once again. | Most Productive FP Lang? |
| 09/23/2005 | Sparc architecture. | Most Productive FP Lang? |
| 09/24/2005 | Why? | Most Productive FP Lang? |
| 09/25/2005 | Scaling results. | Most Productive FP Lang? |
| 09/09/2005 | Purely functional data structures. | Haskell and creative freedom |
| 09/12/2005 | The syntax? | Haskell and creative freedom |
| 09/11/2005 | Lazy evaluation in embedded systems. | System programming using FP |
| 08/25/2005 | Bunch of examples. | Ivory Towers and Gelfand's Principle |
| 08/28/2005 | O'Haskell/Timber does it. | Ivory Towers and Gelfand's Principle |
| 08/25/2005 | Formal reasoning. | Ivory Towers and Gelfand's Principle |
| 08/04/2005 | Performance critical applications | Objective scientific proof of OOP's validity? Don't need no stinkun' proof. |
| 08/05/2005 | Performance of Erlang | Objective scientific proof of OOP's validity? Don't need no stinkun' proof. |
| 08/08/2005 | Inlining | Objective scientific proof of OOP's validity? Don't need no stinkun' proof. |
| 08/08/2005 | Strict vs lazy | Objective scientific proof of OOP's validity? Don't need no stinkun' proof. |
| 08/07/2005 | Parsing C. | Objective scientific proof of OOP's validity? Don't need no stinkun' proof. |
| 08/05/2005 | Performance of functional languages. | Objective scientific proof of OOP's validity? Don't need no stinkun' proof. |
| 07/20/2005 | Translating out of SSA | Conversion of 'functional' to 'imperative' algorithms: is it possible? |
| 06/29/2005 | Polymorphic subtyping | Generics are a mistake? |
| 06/28/2005 | Timber | Dead Languages |
| 07/07/2005 | Timber | Dead Languages |
| 07/08/2005 | Re: Where is Timber | Dead Languages |
| 06/05/2006 | Many languages have | Let's make a programming language! |
| LtU Topic Index Sorted by Date | LtU Topic Index Sorted by Topic | LtU Index of Post Authors | Zipped LtU Archive |