The following pages link to Haskell (Q16052):
Displaying 50 items.
- (Q5019302) (← links)
- (Q5019311) (← links)
- (Q5020559) (← links)
- (Q5020657) (← links)
- (Q5020970) (← links)
- (Q5028420) (← links)
- From Logic to Functional Logic Programs (Q5038460) (← links)
- Semantic Foundations for Deterministic Dataflow and Stream Processing (Q5041103) (← links)
- Higher-Ranked Annotation Polymorphic Dependency Analysis (Q5041115) (← links)
- ConSORT: Context- and Flow-Sensitive Ownership Refinement Types for Imperative Programs (Q5041118) (← links)
- Limits of real numbers in the binary signed digit representation (Q5043582) (← links)
- Linear Dependent Type Theory for Quantum Programming Languages (Q5043587) (← links)
- Fold–unfold lemmas for reasoning about recursive programs using the Coq proof assistant (Q5051990) (← links)
- Transfinite reductions in orthogonal term rewriting systems (Q5055744) (← links)
- Building Specifications in the Event-B Institution (Q5060190) (← links)
- (Q5094148) (← links)
- Theory of M-system (Q5095632) (← links)
- (Q5096574) (← links)
- Incremental Analysis of Logic Programs with Assertions and Open Predicates (Q5097624) (← links)
- Implementing a Library for Probabilistic Programming Using Non-strict Non-determinism (Q5108531) (← links)
- Doo bee doo bee doo (Q5110934) (← links)
- (Q5112631) (← links)
- Permutation groups containing a regular abelian subgroup: the tangled history of two mistakes of Burnside (Q5115550) (← links)
- Fault-tolerant functional reactive programming (extended version) (Q5120226) (← links)
- Local algebraic effect theories (Q5120228) (← links)
- (Q5133479) (← links)
- Rewriting with generalized nominal unification (Q5139280) (← links)
- Syntax and Semantics for Operations with Scopes (Q5145358) (← links)
- Quantitative Information Flow with Monads in Haskell (Q5150956) (← links)
- Attribute Grammars as Recursion Schemes over Cyclic Representations of Zippers (Q5166620) (← links)
- Algebraic Specialization of Generic Functions for Recursive Types (Q5166621) (← links)
- Modularity and Implementation of Mathematical Operational Semantics (Q5166622) (← links)
- Constraint-aware Schema Transformation (Q5166635) (← links)
- Practical typed lazy contracts (Q5168882) (← links)
- Proof-producing synthesis of ML from higher-order logic (Q5168887) (← links)
- Efficient lookup-table protocol in secure multiparty computation (Q5168893) (← links)
- A meta-scheduler for the par-monad (Q5168900) (← links)
- Nested data-parallelism on the gpu (Q5168901) (← links)
- A generic abstract syntax model for embedded languages (Q5168910) (← links)
- Call-pattern specialisation for Haskell programs (Q5168935) (← links)
- A Transformational Approach to Prove Outermost Termination Automatically (Q5170158) (← links)
- Recognizing Strategies (Q5170163) (← links)
- To be or not to be …lazy (In a Parallel Context) (Q5170189) (← links)
- Generic Programming with Multiple Parameters (Q5170707) (← links)
- Computational Semantics with Functional Programming (Q5172339) (← links)
- The impact of higher-order state and control effects on local relational reasoning (Q5176935) (← links)
- Regular, shape-polymorphic, parallel arrays in Haskell (Q5176945) (← links)
- A certified framework for compiling and executing garbage-collected languages (Q5176947) (← links)
- A play on regular expressions (Q5176954) (← links)
- Instance chains (Q5176955) (← links)
