The following pages link to Haskell (Q16052):
Displaying 50 items.
- Bounded refinement types (Q2981942) (← links)
- Applicative bidirectional programming with lenses (Q2981943) (← links)
- Functional pearl: two can keep a secret, if one of them uses Haskell (Q2981971) (← links)
- HLIO: mixing static and dynamic typing for information-flow control in Haskell (Q2981972) (← links)
- Practical principled FRP: forget the past, change the future, FRPNow! (Q2981974) (← links)
- Certified symbolic management of financial multi-party contracts (Q2981976) (← links)
- Sequent calculus as a compiler intermediate language (Q2982003) (← links)
- Queueing and glueing for optimal partitioning (functional pearl) (Q2982011) (← links)
- All sorts of permutations (functional pearl) (Q2982013) (← links)
- Elaborator reflection: extending Idris in Idris (Q2985777) (← links)
- Ghostbuster: a tool for simplifying and converting GADTs (Q2985783) (← links)
- Disjoint intersection types (Q2985786) (← links)
- String diagrams for free monads (functional pearl) (Q2985797) (← links)
- Conservative Concurrency in Haskell (Q2986833) (← links)
- Friends with Benefits (Q2988636) (← links)
- Programs Using Syntax with First-Class Binders (Q2988654) (← links)
- APLicative Programming with Naperian Functors (Q2988659) (← links)
- Verified Characteristic Formulae for CakeML (Q2988660) (← links)
- The Essence of Functional Programming on Semantic Data (Q2988667) (← links)
- Context-Free Session Type Inference (Q2988669) (← links)
- Modular Verification of Higher-Order Functional Programs (Q2988670) (← links)
- HasCasl: Towards Integrated Specification and Development of Functional Programs (Q2996141) (← links)
- A New Method for Dependent Parsing (Q3000590) (← links)
- A Tutorial Implementation of a Dependently Typed Lambda Calculus (Q3002481) (← links)
- Transforming Functional Logic Programs into Monadic Functional Programs (Q3003513) (← links)
- An Access Control Language Based on Term Rewriting and Description Logic (Q3003515) (← links)
- A Functional, Successor List Based Version of Warshall’s Algorithm with Applications (Q3007572) (← links)
- Dependently-Typed Formalisation of Relation-Algebraic Abstractions (Q3007580) (← links)
- Ampersand (Q3007584) (← links)
- Typed quote/antiquote or: Compile-time parsing (Q3016212) (← links)
- Concrete stream calculus: An extended study (Q3021409) (← links)
- NixOS: A purely functional Linux distribution (Q3021413) (← links)
- (Q3046000) (← links)
- (Q3058231) (← links)
- Second-Order Programs with Preconditions (Q3058455) (← links)
- Type Fusion (Q3067469) (← links)
- Generic programming with C++ concepts and Haskell type classes—a comparison (Q3070769) (← links)
- Scala for generic programmers (Q3070770) (← links)
- Factorising folds for faster functions (Q3070772) (← links)
- Abstract Diagnosis of Functional Programs (Q3079916) (← links)
- (Q3081640) (← links)
- A Coinductive Calculus for Asynchronous Side-Effecting Processes (Q3088290) (← links)
- (Q3092742) (← links)
- CoLoR: a Coq library on well-founded rewrite relations and its application to the automated verification of termination certificates (Q3094178) (← links)
- The Teaching Tool CalcCheck A Proof-Checker for Gries and Schneider’s “Logical Approach to Discrete Math” (Q3100213) (← links)
- LaTeX and Friends (Q3100677) (← links)
- (Q3104401) (← links)
- (Q3105108) (← links)
- Emulating Primality with Multiset Representations of Natural Numbers (Q3105752) (← links)
- The probability that a pair of elements of a finite group are conjugate (Q3143917) (← links)
