The following pages link to Haskell (Q16052):
Displaying 50 items.
- Type Class Instances for Type-Level Lambdas in Haskell (Q2814386) (← links)
- Safe zero-cost coercions for Haskell (Q2819677) (← links)
- Refinement types for Haskell (Q2819690) (← links)
- Conjugate hylomorphisms -- or: the mother of all structured recursion schemes (Q2819837) (← links)
- An overview of QML with a concrete implementation in Haskell (Q2825353) (← links)
- Modelling parallel quantum computing using transactional memory (Q2825358) (← links)
- Tests and Proofs for Enumerative Combinatorics (Q2827441) (← links)
- Dependent types and multi-monadic effects in \(\mathrm{F}^*\) (Q2828265) (← links)
- Example-directed synthesis: a type-theoretic interpretation (Q2828323) (← links)
- A declarative debugging system for lazy functional logic programs (Q2841290) (← links)
- Defining actions in concurrent declarative programming (Q2841291) (← links)
- Specialisation of higher-order functions for debugging (Q2841302) (← links)
- The sketch of a polymorphic symphony (Q2843611) (← links)
- A monadic semantics for core Curry (Q2844053) (← links)
- Exploring the boundaries of monad tensorability on Set (Q2848367) (← links)
- Programmable rewriting strategies in Haskell (white paper) (Q2849586) (← links)
- The rewriting logic semantics project (Q2852094) (← links)
- Adaptable software: how to build a modular monadic extensible compiler using the state monad and pseudoconstructors over monadic values (Q2861427) (← links)
- Synthesis of Mealy machines using derivatives (Q2863892) (← links)
- Access control in a core calculus of dependency (Q2864145) (← links)
- Programming languages for interactive computing (Q2864508) (← links)
- Strongly typed rewriting for coupled software transformation (Q2864515) (← links)
- Programmed strategies for program verification (Q2864527) (← links)
- Implementing Gröbner bases for operads (Q2865982) (← links)
- Type-safe code transformations in Haskell (Q2866331) (← links)
- Lightweight static capabilities (Q2866337) (← links)
- Language-based program verification via expressive types (Q2866340) (← links)
- Using Maude and its strategies for defining a framework for analyzing Eden semantics (Q2866804) (← links)
- Structure and properties of traces for functional programs (Q2867898) (← links)
- Quantum data and control made easier (Q2870210) (← links)
- Quantum arrows in Haskell (Q2870213) (← links)
- Handling algebraic effects (Q2871476) (← links)
- An institutional theory for \#-components (Q2873612) (← links)
- Merging hierarchically-structured documents in workflow systems (Q2873660) (← links)
- Termination of lazy rewriting revisited (Q2873676) (← links)
- Narrowing and rewriting logic: from foundations to applications (Q2873786) (← links)
- Reporting failures in functional logic programs (Q2873788) (← links)
- Implementing relational specifications in a constraint functional logic language (Q2873796) (← links)
- Lazy database access with persistent predicates (Q2873797) (← links)
- Using Template Haskell for abstract interpretation (Q2873799) (← links)
- Fractal image compression (Q2875220) (← links)
- On the complexity of stream equality (Q2875229) (← links)
- Proof-producing translation of higher-order logic into pure and stateful ML (Q2875232) (← links)
- Kleene Monads: Handling Iteration in a Framework of Generic Effects (Q2888474) (← links)
- Let’s See How Things Unfold: Reconciling the Infinite with the Intensional (Extended Abstract) (Q2888481) (← links)
- Proving Properties about Functions on Lists Involving Element Tests (Q2890338) (← links)
- Smart Testing of Functional Programs in Isabelle (Q2891447) (← links)
- Programming with higher-order logic. (Q2891520) (← links)
- Adding Equations to System F Types (Q2892742) (← links)
- Adaptable software -- modular extensible monadic entry-pointless type checker in Haskell (Q2893602) (← links)
