The following pages link to Haskell (Q16052):
Displaying 50 items.
- Optimistic evaluation (Q5261284) (← links)
- Static contract checking for Haskell (Q5261504) (← links)
- (Q5261743) (← links)
- Semantics and Efficient Simulation Algorithms of an Expressive Multilevel Modeling Language (Q5270913) (← links)
- Associated types with class (Q5276128) (← links)
- Solving the snake cube puzzle in Haskell (Q5298790) (← links)
- An in-situ algorithm for expanding a graph (Q5298792) (← links)
- When Maybe is not good enough (Q5300698) (← links)
- From natural semantics to C: A formal derivation of two STG machines (Q5302645) (← links)
- Automated Reasoning (Q5307047) (← links)
- Functional and Logic Programming (Q5308027) (← links)
- An extended comparative study of language support for generic programming (Q5308081) (← links)
- Mathematics of Program Construction (Q5313092) (← links)
- Mathematics of Program Construction (Q5313100) (← links)
- Mathematics of Program Construction (Q5313102) (← links)
- Programming Languages and Systems (Q5316565) (← links)
- Program Extraction from Nested Definitions (Q5327357) (← links)
- Functional reactive animation (Q5348880) (← links)
- A theory of core fudgets (Q5348889) (← links)
- Dijkstra monads for free (Q5370885) (← links)
- Learning nominal automata (Q5370894) (← links)
- Teaching types with a cognitively effective worked example format (Q5371940) (← links)
- A representation theorem for second-order functionals (Q5371942) (← links)
- Evaluation of splittable pseudo-random generators (Q5371945) (← links)
- Generating constrained random data with uniform distribution (Q5371949) (← links)
- Formalisation in higher-order logic and code generation to functional languages of the Gauss-Jordan algorithm (Q5371950) (← links)
- Understanding beginners' mistakes with Haskell (Q5371952) (← links)
- Counting and generating terms in the binary lambda calculus (Q5371959) (← links)
- A language for hierarchical data parallel design-space exploration on GPUs (Q5371962) (← links)
- Transparent fault tolerance for scalable functional computation (Q5371963) (← links)
- Composable scheduler activations for Haskell (Q5371964) (← links)
- Skeleton composition versus stable process systems in Eden (Q5371966) (← links)
- Safe zero-cost coercions for Haskell (Q5371973) (← links)
- Quick specifications for the busy programmer (Q5371995) (← links)
- Flexible dynamic information flow control in the presence of exceptions (Q5371997) (← links)
- Interactive programming in Agda – Objects and graphical user interfaces (Q5372002) (← links)
- Principal Type Inference for GHC-Style Multi-parameter Type Classes (Q5385585) (← links)
- An Approach to Fast Arrays in Haskell (Q5390282) (← links)
- Testing and Tracing Lazy Functional Programs Using QuickCheck and Hat (Q5390283) (← links)
- vlogsl: A Strategy Language for Simulation-Based Verification of Hardware (Q5391526) (← links)
- Advanced Functional Programming (Q5394300) (← links)
- Inductive Logic Programming (Q5394649) (← links)
- Theoretical Aspects of Computing – ICTAC 2005 (Q5395102) (← links)
- Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (Q5395645) (← links)
- Enhancing semantic bidirectionalization via shape bidirectionalizer plug-ins (Q5398330) (← links)
- Idris, a general-purpose dependently typed programming language: Design and implementation (Q5398331) (← links)
- A library for polymorphic dynamic typing (Q5398333) (← links)
- Refactoring tools for functional languages (Q5398335) (← links)
- Manipulating accumulative functions by swapping call-time and return-time computations (Q5398337) (← links)
- Declarative Debugging Meets the World (Q5403478) (← links)
