The following pages link to Haskell (Q16052):
Displaying 50 items.
- Functional programming through deep time (Q5176960) (← links)
- On the bright side of type classes (Q5176970) (← links)
- Functional modelling of musical harmony (Q5176972) (← links)
- How to make ad hoc proof automation less ad hoc (Q5176973) (← links)
- Binders unbound (Q5176984) (← links)
- Charting patterns on price history (Q5178004) (← links)
- Events in Haskell, and how to implement them (Q5178006) (← links)
- A new notation for arrows (Q5178012) (← links)
- Searching for deadlocks while debugging concurrent haskell programs (Q5178019) (← links)
- Monadic regions (Q5178027) (← links)
- Functional morphology (Q5178037) (← links)
- Generics for the masses (Q5178038) (← links)
- Scrap more boilerplate (Q5178039) (← links)
- A type-preserving compiler in Haskell (Q5178757) (← links)
- Pattern minimization problems over recursive data types (Q5178767) (← links)
- FPH (Q5178770) (← links)
- Simulation in the Call-by-Need Lambda-Calculus with Letrec, Case, Constructors, and Seq (Q5178823) (← links)
- Functional logic overloading (Q5178909) (← links)
- Automated Reasoning with Analytic Tableaux and Related Methods (Q5187873) (← links)
- Generic Programming (Q5187876) (← links)
- Generic Programming (Q5187877) (← links)
- Ott: Effective tool support for the working semanticist (Q5189646) (← links)
- Dependent Types at Work (Q5191088) (← links)
- Extended Static Checking by Calculation Using the Pointfree Transform (Q5191091) (← links)
- Combinator Parsing: A Short Tutorial (Q5191092) (← links)
- Termination Analysis by Dependency Pairs and Inductive Theorem Proving (Q5191111) (← links)
- Relative Monads Formalised (Q5195253) (← links)
- Translating between Language and Logic: What Is Easy and What Is Difficult (Q5200012) (← links)
- A Dependency Pair Framework for Innermost Complexity Analysis of Term Rewrite Systems (Q5200041) (← links)
- Interleaving Strategies (Q5200118) (← links)
- Towards Formal Proof Script Refactoring (Q5200123) (← links)
- (Q5201286) (← links)
- (Q5216301) (← links)
- Relationships between category theory and functional programming with an application (Q5229862) (← links)
- A theory of core fudgets (Q5234260) (← links)
- Contextual Equivalences in Call-by-Need and Call-By-Name Polymorphically Typed Calculi (Preliminary Report) (Q5240138) (← links)
- Automatic SIMD vectorization for Haskell (Q5244784) (← links)
- Exploiting vector instructions with generalized stream fusion (Q5244786) (← links)
- Optimising purely functional GPU programs (Q5244787) (← links)
- Programming and reasoning with algebraic effects and dependent types (Q5244796) (← links)
- Handlers in action (Q5244797) (← links)
- Correctness of an STM Haskell implementation (Q5244798) (← links)
- System FC with explicit kind equality (Q5244807) (← links)
- The constrained-monad problem (Q5244810) (← links)
- Simple and compositional reification of monadic embedded languages (Q5244812) (← links)
- PROLOG'S CONTROL CONSTRUCTS IN A FUNCTIONAL SETTING — AXIOMS AND IMPLEMENTATION (Q5249252) (← links)
- Dependent types and program equivalence (Q5255080) (← links)
- Localized Operational Termination in General Logics (Q5256340) (← links)
- Dependency-style generic haskell (Q5261272) (← links)
- Functional automatic differentiation with dirac impulses (Q5261273) (← links)
