The following pages link to Haskell (Q16052):
Displaying 50 items.
- A static semantics for Haskell (Q3149004) (← links)
- Developing a high-performance web server in Concurrent Haskell (Q3149005) (← links)
- Faking it Simulating dependent types in Haskell (Q3149006) (← links)
- Secrets of the Glasgow Haskell Compiler inliner (Q3149007) (← links)
- A typed representation for HTML and XML documents in Haskell (Q3149008) (← links)
- Parallel and Distributed Haskells (Q3149009) (← links)
- How to look busy while being as lazy as ever: the Implementation of a lazy functional debugger (Q3150209) (← links)
- Normalization by evaluation with typed abstract syntax (Q3150210) (← links)
- Haskell in Space (Q3160302) (← links)
- The impact of higher-order state and control effects on local relational reasoning (Q3165524) (← links)
- Systematic abstraction of abstract machines (Q3165529) (← links)
- Harnessing the multicores: nested data parallelism in Haskell (Q3165976) (← links)
- Harnessing First Order Termination Provers Using Higher Order Dependency Pairs (Q3172889) (← links)
- Congruence Closure of Compressed Terms in Polynomial Time (Q3172897) (← links)
- Symbolic Trajectory Evaluation (Q3176383) (← links)
- Probabilistic Programming Language and its Incremental Evaluation (Q3179303) (← links)
- Hints in Unification (Q3183522) (← links)
- Turning Inductive into Equational Specifications (Q3183524) (← links)
- A Hoare Logic for the State Monad (Q3183544) (← links)
- Certification of Termination Proofs Using CeTA (Q3183545) (← links)
- Generalized Theoroidal Institution Comorphisms (Q3184726) (← links)
- A Reflection on Types (Q3188294) (← links)
- Operational semantics for multi-language programs (Q3189775) (← links)
- Modular type classes (Q3189786) (← links)
- Proving Termination of Programs Automatically with AProVE (Q3192189) (← links)
- Algorithm Design with Haskell (Q3305696) (← links)
- Interactive proof-search for equational reasoning (Q3386920) (← links)
- (Q3400627) (← links)
- Practical type inference for arbitrary-rank types (Q3419812) (← links)
- Spreadsheet functional programming (Q3419815) (← links)
- Type-safe run-time polytypic programming (Q3426133) (← links)
- (Q3430686) (← links)
- A monadic, functional implementation of real numbers (Q3431547) (← links)
- Testing from Algebraic Specifications: Test Data Set Selection by Unfolding Axioms (Q3434613) (← links)
- Ruler: Programming Type Rules (Q3434622) (← links)
- Lock Free Data Structures Using STM in Haskell (Q3434626) (← links)
- Typed Contracts for Functional Programming (Q3434634) (← links)
- Warnings for pattern matching (Q3444659) (← links)
- Essentials of Programming in <i>Mathematica</i>® (Q3450159) (← links)
- Computational Topology via Functional Programming: A Baseline Analysis (Q3454945) (← links)
- Unifying Theories of Programming with Monads (Q3455643) (← links)
- Marimba: A Tool for Verifying Properties of Hidden Markov Models (Q3460559) (← links)
- Type Checking by Domain Analysis in Ampersand (Q3460627) (← links)
- Haskell before Haskell: an alternative lesson in practical logics of the ENIAC (Q3465045) (← links)
- Optimizing object queries using an effective calculus (Q3507276) (← links)
- iRho: an imperative rewriting calculus (Q3520144) (← links)
- A call-by-need lambda calculus with locally bottom-avoiding choice: context lemma and correctness of transformations (Q3520145) (← links)
- Coercions in a polymorphic type system (Q3520150) (← links)
- Safety of Nöcker's strictness analysis (Q3520168) (← links)
- Scrap Your Type Applications (Q3521978) (← links)
