Higher Logics

I came across this type-safe module for handling file paths in the Haskell subreddit this week, and thought it looked kind of neat. Handling paths as strings, even with System.IO.Path always bugged me. So I created a close C# equivalent of the Haskell type and added it to the Sasa library , to be available in the upcoming v0.9.3 release: public struct FsPath : IEnumerable<string>, IEnumerable { public FsPath(IEnumerable<string> parts); public FsPath(string path); public static FsPath operator /(FsPath path1, FsPath path2); public static FsPath operator /(FsPath path, IEnumerable<string> parts); public static FsPath operator /(FsPath path, string part); public static FsPath operator /(FsPath path, string[] parts); public static FsPath operator /(IEnumerable<string> parts, FsPath path); public static FsPath operator /(string part, FsPath path); public static FsPath operator /(string[] parts, FsPath path); public static implicit operator FsPath(string

I just completed a statically typed Pratt-style single-state extensible lexer+parser, otherwise known as a top-down operator precedence parser, for the Sasa library . The implementation is available in the Sasa.Parsing dll, under Sasa.Parsing.Pratt . Two simple arithmetic calculators are available in the unit tests . This implementation is novel in two ways: Aside from an alleged implementation in Ada , this is the only statically typed Pratt parser I'm aware of. Pratt parsers typically require a pre-tokenized input before parsing semantic tokens, but I've eliminated this step by using the symbol definitions to drive a longest-match priority-based lexer. Symbols by default match themselves, but you can optionally provide a scanning function used to match arbitrary string patterns. The symbol selected for the current position of the input is the symbol that matches the longest substring. If two symbols match equally, then the symbol with higher precedence is selected. The design