Posts By: Josef Svenningsson
Date | Post | Topic |
09/08/2010 | Based on my observations I would tend to agree | Is Transactional Programming Actually Easier? |
05/26/2010 | Andre Santos thesis | Types/Ordering of canonical FP compiler transforms and optimizations? |
04/02/2009 | Interesting optimization | A Computer-Generated Proof that P=NP |
04/15/2008 | Security is relative, but still meaningful | The irreducible physicality of security properties |
01/10/2008 | I will chicken out and say | Prediction for 2008 |
10/12/2007 | Erlang | Examples of large-scale functional language projects |
08/19/2007 | I think these kind of | Compiling with Continuations, Continued |
08/20/2007 | The way they implemented | Compiling with Continuations, Continued |
05/04/2007 | That paper just blew my mind | Towards efficient, typed LR parsers |
03/09/2007 | Focus on the wrong thing | Static Typing for a Faulty Lambda Calculus |
02/15/2007 | I agree | Lightweight Fusion by Fixed Point Promotion |
02/06/2007 | On Termination | Termination Checking with Types |
12/24/2006 | Promising work | Data Parallel Haskell: a status report |
12/08/2006 | An important paper indeed | [Redux] A Syntactic Approach to Type Soundness (1992) |
11/24/2006 | Some random reflections | Grammar Visualization |
06/21/2006 | Amen, brother! | Rules for Developing Safety-Critical Code |
05/10/2006 | Proof carrying code | Computer Science Looks for a Remake |
05/10/2006 | Proof, correctness and pay-as-you-go | Computer Science Looks for a Remake |
05/12/2006 | Swap | Designing a Type Notation for a Stack Based Functional Language |
05/03/2006 | Your favourite editor/IDE | Your favourite editor/IDE |
05/02/2006 | A slightly OT question | Proofs are Programs: 19th Century Logic and 21st Century Computing |
05/02/2006 | Thanks | Proofs are Programs: 19th Century Logic and 21st Century Computing |
05/04/2006 | Computers Ltd | Proofs are Programs: 19th Century Logic and 21st Century Computing |
05/02/2006 | Hmmm... | Proofs are Programs: 19th Century Logic and 21st Century Computing |
05/04/2006 | Informatics | Proofs are Programs: 19th Century Logic and 21st Century Computing |
05/03/2006 | Software | Proofs are Programs: 19th Century Logic and 21st Century Computing |
05/04/2006 | The root of the problem | Proofs are Programs: 19th Century Logic and 21st Century Computing |
05/05/2006 | You're absolutely right | Proofs are Programs: 19th Century Logic and 21st Century Computing |
04/04/2006 | Everything-is-a proof | Purity in PLT |
03/30/2006 | This paper comes after CMT | Transactional Memory with data invariants (draft sequel to the STM-Haskell paper) |
03/21/2006 | Using continuations in Web applications is patented | Using continuations in Web applications is patented |
03/02/2006 | Cool paper! | A Tail-Recursive Machine with Stack Inspection |
06/21/2006 | Deriving combinator libraries a la John Hughes | How are GADTs useful in practical programming? |
01/23/2006 | Windows XP | Choice of OS of LtU readers |
01/10/2006 | The problem is not XML | Tim Bray: Don't Invent XML Languages |
12/15/2005 | Linear Types | Djinn, a theorem prover in Haskell, for Haskell. |
10/26/2005 | Incremental Algorithms | Incremental algorithm help |
10/20/2005 | Not very relevant to LtU | Multigame A Very High Level Language for Describing Board Games |
10/12/2005 | More Microsoft | Formal methods used in developing "profitable" software |
07/27/2005 | Functional/non-functional and strict/lazy | The Complexity Zoo |
06/30/2005 | inclusion polymorphism and parametric polymorphism for dummies | Generics are a mistake? |
06/28/2005 | Cayenne -> Agda | Dead Languages |
06/23/2005 | Write a program | How To Read a Paper |
06/27/2005 | No exception! Use constructive logic | How To Read a Paper |
06/19/2005 | Nice to see some application | Accurate step counting |
05/29/2005 | BDDs | Short examples of complex use of state? |
05/30/2005 | Applicative Languages ARE inefficient. | Short examples of complex use of state? |
05/30/2005 | On interpreting theoretical results. | Short examples of complex use of state? |
05/27/2005 | A good page for finding point | Data flow analysis on functional Language |
05/21/2005 | QuickCheck | Parameterized Unit Tests |
05/20/2005 | Tail-call JVMs can exist! | Tail recursion |
05/10/2005 | Covered before | Why Dependent Types Matter |
04/21/2005 | Wrong headline | Computer generates verifiable mathematics proof |
04/15/2005 | A pointer | Garbage collecting computations |
03/18/2005 | Power Point? | Grady Booch: AOSD keynote |
03/15/2005 | A rather obscure example | Embedding one language in another |
03/07/2005 | Phil Wadler's blog | Phil Wadler's blog |
02/02/2005 | Scary | GCC Wiki |
01/27/2005 | More, More! | Langauges and Hardware... |
01/18/2005 | Advanced Topics in Types and Programming Languages | Advanced Topics in Types and Programming Languages |
12/02/2004 | Langugages or libraries | Downwardly Scalable Languages |
11/13/2004 | Seems backwards | Giving Bugs the Boot |
11/09/2004 | Language comparison | Language comparison experiment |
10/21/2004 | Constraint programming | Playing the Minesweeper with Constraints (MOZ 2004) |
10/06/2004 | Die rolling? | Probabilistic languages for kids? |
10/08/2005 | Context Free Design Grammars | Probabilistic languages for kids? |
LtU Topic Index Sorted by Date | LtU Topic Index Sorted by Topic | LtU Index of Post Authors | Zipped LtU Archive |