The following pages link to Haskell (Q16052):
Displaying 50 items.
- Zeno: An Automated Prover for Properties of Recursive Data Structures (Q2894285) (← links)
- Compiling Haskell to JavaScript through Clean's core (Q2898774) (← links)
- Extended pattern matching for embedded languages (Q2898788) (← links)
- Correct Looping Arrows from Cyclic Terms (Q2900260) (← links)
- A System for Axiomatic Programming (Q2907330) (← links)
- Dependently Typed Programming Based on Automated Theorem Proving (Q2908568) (← links)
- A domain-specific language for computing on encrypted data. (Invited talk) (Q2911606) (← links)
- Sorted. Verifying the problem of the Dutch national flag in Agda (Q2913925) (← links)
- Verifying and Generating WP Transformers for Procedures on Complex Data (Q2914738) (← links)
- Synthesis of Distributed Mobile Programs Using Monadic Types in Coq (Q2914742) (← links)
- Simple Rectangle-Based Functional Programs for Computing Reflexive-Transitive Closures (Q2915139) (← links)
- Using Relations to Develop a Haskell Program for Computing Maximum Bipartite Matchings (Q2915140) (← links)
- Observationally-induced algebras in domain theory (Q2921115) (← links)
- Inferring algebraic effects (Q2921118) (← links)
- Formalizing workflows partitioning over federated clouds: multi-level security and costs (Q2921900) (← links)
- On Termination, Confluence and Consistent CHR-based Type Inference (Q2931268) (← links)
- Copatterns (Q2931780) (← links)
- HALO (Q2931819) (← links)
- Principled parsing for indentation-sensitive languages (Q2931836) (← links)
- Deletion: The curse of the red-black tree (Q2933113) (← links)
- Dynamic optimization for functional reactive programming using generalized algebraic data types (Q2936767) (← links)
- A principled approach to operating system construction in Haskell (Q2936775) (← links)
- Qualified types for MLF (Q2936777) (← links)
- Scrap your boilerplate with class (Q2936783) (← links)
- Associated type synonyms (Q2936787) (← links)
- Monadic augment and generalised short cut fusion (Q2936792) (← links)
- Purely functional lazy non-deterministic programming (Q2936798) (← links)
- Runtime support for multicore Haskell (Q2936802) (← links)
- Experience report (Q2936807) (← links)
- Attribute grammars fly first-class (Q2936823) (← links)
- A concurrent ML library in concurrent Haskell (Q2936827) (← links)
- Programming Type-Safe Transformations Using Higher-Order Abstract Syntax (Q2938052) (← links)
- Notions of Bidirectional Computation and Entangled State Monads (Q2941175) (← links)
- GADTs meet their match: pattern-matching warnings that account for GADTs, guards, and laziness (Q2945524) (← links)
- Deriving Comparators and Show Functions in Isabelle/HOL (Q2945654) (← links)
- Rewriting Strategies and Strategic Rewrite Programs (Q2945718) (← links)
- From Rewriting Logic, to Programming Language Semantics, to Program Verification (Q2945730) (← links)
- A Certified Reduction Strategy for Homological Image Processing (Q2946732) (← links)
- Game Semantics and Normalization by Evaluation (Q2948551) (← links)
- Exception analysis for non-strict languages (Q2949196) (← links)
- Typing dynamic typing (Q2949202) (← links)
- Type classes with more higher-order polymorphism (Q2949205) (← links)
- Functional Kleene Closures (Q2949712) (← links)
- Specifying type systems (Q2956732) (← links)
- Evidence normalization in System FC (invited talk) (Q2958372) (← links)
- Extending Abramsky's lazy lambda calculus: (non)-conservativity of embeddings (Q2958387) (← links)
- (Q2960909) (← links)
- Implementing Variable Vectors in a CCG Parser (Q2963994) (← links)
- UTPCalc — A Calculator for UTP Predicates (Q2971182) (← links)
- (Q2980965) (← links)
