Lambda the Ultimate Weblog Topics
Last Updated 07/17/2012

Posts By: Oleg

  Date    Post    Topic  
03/24/2012Caution about conflating shift with yieldProgramming with Algebraic Effects and Handlers
11/01/2011Expression problem solutions in HaskellExtensible Programming with First-Class Cases
11/02/2011answers to your questionsExtensible Programming with First-Class Cases
08/04/2011Monad transformers: complexities and limitationsLightweight Monadic Programming in ML
07/16/2011Do not implement undelimited continuationsImplementor's guide/tutorial to delimited continuations?
07/15/2011Several implementors guidesImplementor's guide/tutorial to delimited continuations?
07/19/2011Which operator to implementImplementor's guide/tutorial to delimited continuations?
07/19/2011Limited expressivity and composability of undelimited continuatiImplementor's guide/tutorial to delimited continuations?
05/13/2011SupercompilationIn search of inspiration
12/30/2010Maps and generic programming as solutionsThe AST Typing Problem
08/10/2010Open unions and exceptions are profoundly relatedHow to classify type of ML's exn ? (Naive question)
08/19/2010Meta-programming is inevitableType Classes as Objects and Implicits
08/21/2010Today, optimizing for 1 platform is not a goalType Classes as Objects and Implicits
08/21/2010The extent of meta-problemsType Classes as Objects and Implicits
08/21/2010Meta-programming at ICFP 2010Type Classes as Objects and Implicits
08/05/2010Overlapping Instances + FD in GHC are still soundOverlapping Instances + Functional Dependencies Unsound?
05/04/2010Safe resource handling is already possible in HaskellLinear & Dependent types of ATS applied to the Cairo graphics library
11/03/2009ADT may be typed as existentials, but this isn't the only choiceOn Understanding Data Abstraction, Revisited
10/28/2009Semantic and syntactic notions of typeWhat is a Type?
10/02/2009Code migration with delimited continuationsSwarm now based on Scala 2.8, uses delimited continuations
06/10/2009Embedded probabilistic functional programmingBridging the informal and the formal
04/25/2009Conditional type-checkingAndrej Bauer on PLD
03/25/2009Embedding DSL efficientlyD is for Domain and Declarative
12/25/2008A minimalist Eratosthenes SieveThe Genuine Sieve of Eratosthenes
12/04/2008We do solve the documented problemStaging with Delimited Control
11/06/2008A less canonical tutorial on (polymorphic) type inferenceA tutorial on implemeting type inference?
11/01/2008No Total functional language self interpreterTotal functional language self interpreter?
09/18/2008Typing polyvariadic functions, including zipNWithGenericity over tuples
07/25/2008Restricted data typesType classes and type generator restrictions
06/12/2008More transformations in terms of foldsOn the importance of Turing completeness
06/24/2008Statically safe resource deallocationBreaking region nesting in type-and-effect systems?
04/05/2008Many drawbacks of monads and monad transformersApril 1st special: The War of the Worlds
02/29/2008Stress on purityPure, Declarative, and Constructive Arithmetic Relations
03/05/2008How far along we can push the extensional approachPure, Declarative, and Constructive Arithmetic Relations
12/17/2007Typed compilation, proofs and stagingClosing the Stage: From Staged Code to Typed Closures
03/25/2009IncopeTypecheck.hs: building witnesses with weakeningClosing the Stage: From Staged Code to Typed Closures
09/15/2007Statically assuring the absence of head [] errorsExtending HM type inference -- would this be possible? Or even desirable?
09/15/2007Tagless typed self-interpretationTagless Staged Interpreters for Simpler Typed Languages
09/05/2007The parsing/typechecking problemTagless Staged Interpreters for Simpler Typed Languages
09/05/2007The type of a parser?Tagless Staged Interpreters for Simpler Typed Languages
11/24/2007staging as dynamic linkingTagless Staged Interpreters for Simpler Typed Languages
12/11/2007Dynamic loading and stagingTagless Staged Interpreters for Simpler Typed Languages
04/06/2010Simplified tagless-final type-checkerTagless Staged Interpreters for Simpler Typed Languages
06/02/2007CONTEXT07. Delimited contexts in OSCONTEXT07. Delimited contexts in OS
05/09/2007Typeclasses in MLThe Monad.Reader
04/11/2007open heterogeneous lists and downcasts in MLCforall
03/14/2007Dynamic code, Arrays, bit twiddlingThe Current Practical Limit of Static Typing
03/09/2007Re: imperfect blendBlending static and dynamic typing
03/09/2007RepliesLightweight static resources
03/15/2007Thank you for the commentsLightweight static resources
02/09/2007Formalizing OS in a strongly normalizing languageTermination Checking with Types
12/11/2006Resumable exceptions are very easyContinuations and freeing the stack
12/06/200615th last elementProgramming (language) puzzles
12/06/2006Solution to pruned tree outlineProgramming (language) puzzles
11/24/2006Haskell can do some of the proofs itselfProofs that do things
10/21/2006call/cc is problematic in OCaml!Specifying ECMAScript via ML
10/21/2006delimited continuations in OCamlSpecifying ECMAScript via ML
09/05/2006Syntactic approach to type soundness, in TwelfLightweight Static Capabilitites (II)
06/24/2006Ref. transparency, delim. cont., capabilitiesDelimited dynamic binding
06/24/2006Code is availableDelimited dynamic binding
10/09/2006Presentation and formalizationDelimited dynamic binding
06/07/2006Simple implementation of (typed) resumable excCommon Lisp Exception Handling
06/04/2006CPS and Glivenko theoremRelevance of Curry-Howard
07/20/2006Extensible unions as negation of extensible recordsFirst Class Values, Types as values within a Programming Language
04/05/2006Dynamic bindingNative delimited continuations in (byte-code) OCaml
04/10/2006Private and shared dynamic bindingsNative delimited continuations in (byte-code) OCaml
04/12/2006Dynamic binding (and threads) in OCamlNative delimited continuations in (byte-code) OCaml
02/10/2006Lightweight dependent typesHow are GADTs useful in practical programming?
02/11/2006Eliminating Multiple-Array Bound Checking through Non-dependentHow are GADTs useful in practical programming?
01/20/2006See Stanford Encyclopedia of PhilosophyWhat is a Proposition?
01/14/2006Another articleTowards the best collection traversal interface
01/18/2006Re: complaintsTowards the best collection traversal interface
01/02/2006Monads and free algebrasThe Haskell Programmer's Guide to the IO Monad --- Don't Panic
12/02/2005Haskell already has union typesConjunction types
11/23/2005Dependent type encodings in Haskell or MLDependent types: literature, implementations and limitations ?
10/07/2005Iteration via delimited continuationsScoping based on control flow graph
09/22/2005How well Haskell98 can encode objectsHaskell's overlooked object system
09/14/2005Zipper and XML differencingAre you using delimited continuations?
09/15/2005Re: Unfathomable?Generic implementation of all four *F* operators: from control0 to shift
09/02/2005Quoting in Lisp vs. (Meta)OcamlYearning for a practical scheme
07/24/2005Lazy matrices and streamsLazy linear algebra
07/07/2005O'Haskell alive successor: Reactive ObjectsDead Languages
05/03/2005Implicit type conversions in Scheme and HaskellCall for Papers: ACM Symposium on Dynamic Languages
04/22/2005How to Believe a Machine-Checked ProofComputer generates verifiable mathematics proof
04/23/2005The number of multiplicationsRelating FFTW and Split-Radix
05/14/2005SPIRAL signal-processing code generation systemRelating FFTW and Split-Radix
04/02/2005The context C[] is more complex than it appearsHow to remove a dynamic prompt: static and dynamic delimited continuation operators are equally expressible
11/20/2004A similar project: SXMLSkribe 1.2b released
10/07/2004Language with random variables, and the Monte Carlo monadProbabilistic languages for kids?
10/10/2005Re: Probabilistic Language and monadsProbabilistic languages for kids?
09/15/2004Haskell and objectsFaking it (even better)
09/15/2004Sharing by specification and taming the parameter explosionHigher-order module system of ML is actually possible in Haskell
10/11/2006Double-colon barrierWhy type systems are interesting - part II
10/11/2006Re: Even number typeWhy type systems are interesting - part II
08/03/2004Exception-free programming in Haskell98Tail of Nil and Its Type
08/01/2004They are not the same. Difficulties of the FFT generationA Methodology for Generating Verified Combinatorial Circuits
05/14/2005More referencesA Methodology for Generating Verified Combinatorial Circuits
07/23/2004Strongly-typed databasesDatabase Theory and Type systems/Programming Languages.
01/21/2012In offense of cutEmbedding Prolog in Haskell
01/25/2005What (call/cc call/cc) is and isn'tUnderstanding continuations
06/25/2004Dimensional (units) type in HaskellIs "type" a fundamental intrinsic property of values?
06/25/2004Refs about macros and program generationCode Generation Netwrok
05/06/2004Re: Programming as if Performance MatteredProgramming as if Performance Mattered
04/11/2004Re: Circular referencesCircular references
03/07/2004Re: Practical Aspects of Multi-Stage ProgrammingPractical Aspects of Multi-Stage Programming
03/05/2004Re: Book Review: Purely Functional Data StructuresBook Review: Purely Functional Data Structures
03/05/2004Re: Every Language War EverEvery Language War Ever
03/09/2004Re: Every Language War EverEvery Language War Ever
02/27/2004Re: Monads in SchemeMonads in Scheme
02/09/2004Re: DarcsDarcs
02/08/2004Re: GraphPathGraphPath
01/05/2004Re: Continuations (and call/cc) in HaskellContinuations (and call/cc) in Haskell
09/03/2003Re: Using RubyUsing Ruby
09/05/2003Re: Using RubyUsing Ruby
08/03/2003Re: Theorems for free!Theorems for free!
07/10/2003Re: Linguistic Universals and ParticularsLinguistic Universals and Particulars
07/04/2003Re: CDuce: a programming language adapted to the manipulation of XML documentsCDuce: a programming language adapted to the manipulation of XML documents
07/18/2003Re: CDuce: a programming language adapted to the manipulation of XML documentsCDuce: a programming language adapted to the manipulation of XML documents
06/27/2003Re: Charming Python: Using combinatorial functions in the itertools moduleCharming Python: Using combinatorial functions in the itertools module
05/25/2003Re: Tim Bray: The History of RDFTim Bray: The History of RDF
05/15/2003Re: Language Myths AgainLanguage Myths Again
05/18/2003Re: Language Myths AgainLanguage Myths Again
03/19/2003Re: XML Is Too Hard For ProgrammersXML Is Too Hard For Programmers
03/07/2003Re: Call-by-name is dual to call-by-valueCall-by-name is dual to call-by-value
03/03/2003Re: Linguistic side effectsLinguistic side effects
03/03/2003Re: Linguistic side effectsLinguistic side effects
12/30/2002Re: Y in Practical ProgramsY in Practical Programs
12/09/2002Re: De-biforestationDe-biforestation
11/26/2002Re: Impressions of the International Lisp conference ILC2002Impressions of the International Lisp conference ILC2002
11/05/2002Re: A Good OOP Critique?A Good OOP Critique?
11/06/2002Re: A Good OOP Critique?A Good OOP Critique?
11/11/2002Re: A Good OOP Critique?A Good OOP Critique?
11/15/2002Re: A Good OOP Critique?A Good OOP Critique?
10/16/2002Re: CurryingCurrying
10/09/2002Re: o:XMLo:XML
09/02/2002Re: Symmetric difference in LC, P-numerals, and foldSymmetric difference in LC, P-numerals, and fold
07/19/2002Re: XLANG and WSFL: Syntactic ArsenicXLANG and WSFL: Syntactic Arsenic
07/15/2002Re: More USENIX02 summaries from OlegMore USENIX02 summaries from Oleg
06/10/2002Re: dealing with Scheme (or Lisp, etc)dealing with Scheme (or Lisp, etc)
06/11/2002Re: dealing with Scheme (or Lisp, etc)dealing with Scheme (or Lisp, etc)
05/10/2002Re: Using Functional Objects in various languagesUsing Functional Objects in various languages
04/22/2002Re: AOP: The 15% SolutionAOP: The 15% Solution
04/23/2002Re: AOP: The 15% SolutionAOP: The 15% Solution
04/17/2002Re: ENVIRONMENTAL ACQUISITION - A NEW INHERITANCE MECHANISMEnvironmental Acquisition - A New InheritancE Mechanism
04/03/2002Re: Simple Outline XML: SOXSimple Outline XML: SOX
04/02/2002Re: Computer Scientist Gets to the Bottom of Financial ScandalComputer Scientist Gets to the Bottom of Financial Scandal
03/10/2002Natural and programming languages: Perl & German or LatinLingua::Romana::Perligata
02/21/2002Re: Semantics-based Filtering: Logic Programming's Killer App?Semantics-based Filtering: Logic Programming's Killer App?
02/19/2002Re: A Programming ParadoxA Programming Paradox
02/18/2002Re: The CSS debate rages onThe CSS debate rages on
02/17/2002Re: SVG - Open for BusinessSVG - Open for Business
02/17/2002Re: SVG - Open for BusinessSVG - Open for Business
02/18/2002Re: SVG - Open for BusinessSVG - Open for Business
02/08/2002Re: Type checking is usefulDon Box on the Importance of Being WSDL
02/06/2002Impedance mismatch in web programmingThe Web Server is Fully Functional
01/31/2002Unix Design PhilosophyMultics Software Features
02/01/2002Re: Multics Software FeaturesMultics Software Features
01/29/2002PADL: Beautiful textures by combining functionsPADL: Beautiful textures by combining functions
01/24/2002Mining specificationsSLAM (at POPL)
01/25/2002Re: SLAM (at POPL)SLAM (at POPL)
01/25/2002Re: SLAM (at POPL)SLAM (at POPL)
01/25/2002Re: Web services: Winer on WSDLWeb services: Winer on WSDL
01/04/2002Re: Practical Theory (was: T)Practical Theory (was: T)
12/10/2001Re: Languages or tools to play with rewrite rules?Languages or tools to play with rewrite rules?
11/12/2001Re: Readership skills and graphical programmingReadership skills and graphical programming
11/08/2001Re: Web Services Inspection LanguageWeb Services Inspection Language
10/29/2001Re: Children?s Understanding of Process and Robot BehaviorsChildren’s Understanding of Process and Robot Behaviors
10/30/2001Re: Children?s Understanding of Process and Robot BehaviorsChildren’s Understanding of Process and Robot Behaviors
10/24/2001Re: Instruction scheduling and imperative functional programmingInstruction scheduling and imperative functional programming
10/08/2001Re: Generators in Python, Icon and SchemeGenerators in Python, Icon and Scheme
10/09/2001Re: Generators in Python, Icon and SchemeGenerators in Python, Icon and Scheme
08/24/2001Monads everywhereCategory theory for non-mathematicians
08/03/2001Re: Folding over treesFolding over trees
08/06/2001Re: Folding over treesFolding over trees
08/02/2001Re: The ICFP Programming Contest is underway!The ICFP Programming Contest is underway!
07/10/2003Re: Hidden complexities of tail-call/tail-recursion optimizationHidden complexities of tail-call/tail-recursion optimization
05/11/2001Re: How fundamental is information?How fundamental is information?
05/04/2001Re: Uses of macrosFurther information on "Beating The Averages"
05/04/2001Re: Simple explanation of Continuation PassingSimple explanation of Continuation Passing
05/06/2001Re: Simple explanation of Continuation PassingSimple explanation of Continuation Passing
04/25/2001Re: Future Directions for C++Future Directions for C++
04/26/2001Re: Future Directions for C++Future Directions for C++
04/26/2001Re: Future Directions for C++Future Directions for C++
04/05/2001"Maths is true by accident.""Maths is true by accident."
04/05/2001Re: C# interview / OOP in any languageC# interview / OOP in any language
03/30/2001First-class Environments are harmfulSharing Code through First-class Environments
03/15/2001Re: Atoms as Objects?Atoms as Objects?
02/26/2001Re: XSLT Extensions RevisitedXSLT Extensions Revisited

LtU Topic Index Sorted by Date LtU Topic Index Sorted by Topic LtU Index of Post Authors Zipped LtU Archive

Chris Rathman/ Chris.Rathman@tx.rr.com