The following pages link to Haskell (Q16052):
Displaying 50 items.
- Quantifier elimination and parametric polymorphism in programming languages (Q4763983) (← links)
- The complexity of type inference for higher-order typed lambda calculi (Q4764610) (← links)
- Higher-order functions for parsing (Q4764615) (← links)
- (Q4783311) (← links)
- Semantics of value recursion for Monadic Input/Output (Q4787832) (← links)
- Component support in PLT scheme (Q4791021) (← links)
- FC++: Functional tools for object-oriented tasks (Q4791026) (← links)
- (Q4792778) (← links)
- (Q4794702) (← links)
- (Q4796135) (← links)
- (Q4808688) (← links)
- (Q4808692) (← links)
- (Q4813116) (← links)
- (Q4813221) (← links)
- (Q4813222) (← links)
- (Q4816997) (← links)
- (Q4817289) (← links)
- Operational aspects of untyped Normalisation by Evaluation (Q4818938) (← links)
- Logic programming in the context of multiparadigm programming: the Oz experience (Q4819002) (← links)
- Grammatical Framework (Q4819368) (← links)
- Constructed product result analysis for Haskell (Q4819370) (← links)
- A system of constructor classes: overloading and implicit higher-order polymorphism (Q4836019) (← links)
- Type Reconstruction for Type Classes (Q4850163) (← links)
- Sparse matrix representations in a functional language (Q4880528) (← links)
- (Q4912026) (← links)
- (Q4912845) (← links)
- A Generic Functional Representation of Sorted Trees Supporting Attribution (Q4916074) (← links)
- Functional Logic Programming: From Theory to Curry (Q4916076) (← links)
- When is a function a fold or an unfold? (Q4917036) (← links)
- <scp>OutsideIn(X)</scp>Modular type inference with local assumptions (Q4918240) (← links)
- Causal commutative arrows (Q4918242) (← links)
- Derivable Type Classes (Q4921511) (← links)
- An Overview of Edison (Q4921513) (← links)
- (Q4922308) (← links)
- (Q4929334) (← links)
- (Q4936328) (← links)
- (Q4945244) (← links)
- Call-by-value Solvability (Q4953339) (← links)
- COCHIS: Stable and coherent implicits (Q4972074) (← links)
- On the enumeration of closures and environments with an application to random generation (Q4972734) (← links)
- HTab: a Terminating Tableaux System for Hybrid Logic (Q4982111) (← links)
- CoLoSS: The Coalgebraic Logic Satisfiability Solver (Q4982113) (← links)
- A Formal, Resource Consumption-Preserving Translation from Actors with Cooperative Scheduling to Haskell* (Q4988924) (← links)
- Counting environments and closures (Q4993337) (← links)
- A Syntax for Higher Inductive-Inductive Types (Q4993350) (← links)
- Representations and evaluation strategies for feasibly approximable functions (Q4995603) (← links)
- (Q5013828) (← links)
- (Q5013889) (← links)
- Explainable dynamic programming (Q5016213) (← links)
- Protocol combinators for modeling, testing, and execution of distributed systems (Q5018776) (← links)
