GHC

swMATH6691MaRDI QIDQ18773FDOQ18773

Author name not available (Why is that?)

Described by source

• Secrets of the Glasgow Haskell Compiler inliner

Cited In (95)

• Type inference for variant object types
• From natural semantics to C: A formal derivation of two STG machines
• Eager and delayed contract monitoring for call-by-value and call-by-name evaluation
• Composable scheduler activations for Haskell
• Title not available (Why is that?)
• Maintaining a library of formal mathematics
• Title not available (Why is that?)
• Nominal unification with letrec and environment-variables
• Preserving Sharing in the Partial Evaluation of Lazy Functional Programs
• Title not available (Why is that?)
• Directly reflective meta-programming
• Title not available (Why is that?)
• Polar type inference with intersection types and \(\omega\)
• Ruler: Programming Type Rules
• Scoped dynamic rewrite rules
• Dynamic optimization for functional reactive programming using generalized algebraic data types
• On Termination, Confluence and Consistent CHR-based Type Inference
• A principled approach to operating system construction in Haskell
• System FC with explicit kind equality
• Costing stepwise refinements of parallel programs
• Complexity bounds for container functors and comonads
• A Generic Intermediate Representation for Verification Condition Generation
• Title not available (Why is that?)
• Selective strictness and parametricity in structural operational semantics, inequationally
• Towards the uniform implementation of declarative languages
• Fusing logic and control with local transformations: an example optimization
• Optimistic evaluation
• Principality and type inference for intersection types using expansion variables
• Computing cup products in integral cohomology of Hilbert schemes of points on \(K3\) surfaces
• Experiments in Theorem Proving for Topological Hybrid Logic
• HTab: a Terminating Tableaux System for Hybrid Logic
• A calculus with polymorphic and polyvariant flow types
• Derivable Type Classes
• Title not available (Why is that?)
• A survey of strategies in rule-based program transformation systems
• How to prove decidability of equational theories with second-order computation analyser SOL
• Language-based program verification via expressive types
• A certified framework for compiling and executing garbage-collected languages
• Binders unbound
• Executable Relational Specifications of Polymorphic Type Systems Using Prolog
• A call-by-need lambda calculus with locally bottom-avoiding choice: context lemma and correctness of transformations
• Title not available (Why is that?)
• Easy composition of symbolic computation software using SCSCP: a new Lingua Franca for symbolic computation
• Title not available (Why is that?)
• Title not available (Why is that?)
• Comprehending Ringads
• Programming in Haskell
• Dual analysis for proving safety and finding bugs
• Profiling large-scale lazy functional programs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Maude versus Haskell: An experimental comparison in security protocol analysis
• Implementation of Functional Languages
• Principal Type Inference for GHC-Style Multi-parameter Type Classes
• Haskell Type Constraints Unleashed
• Call-pattern specialisation for Haskell programs
• Generic multiset programming with discrimination-based joins and symbolic Cartesian products
• Sequent calculus as a compiler intermediate language
• Composition of functions with accumulating parameters
• Semantic Labelling for Proving Termination of Combinatory Reduction Systems
• Exploiting vector instructions with generalized stream fusion
• Derivation and inference of higher-order strictness types
• Title not available (Why is that?)
• From ML to Ada: Strongly-typed language interoperability via source translation
• A purely functional computer algebra system embedded in Haskell
• Using Maude and its strategies for defining a framework for analyzing Eden semantics
• An abstract monadic semantics for value recursion
• Using Template Haskell for abstract interpretation
• Regular expression pattern matching for XML
• A short cut to optimal sequences
• Random generation of closed simply typed λ-terms: A synergy between logic programming and Boltzmann samplers
• Warnings for pattern matching
• Safe zero-cost coercions for Haskell
• Title not available (Why is that?)
• Automatic SIMD vectorization for Haskell
• COCHIS: Stable and coherent implicits
• Build systems à la carte: Theory and practice
• Title not available (Why is that?)
• Syntactic composition of top-down tree transducers is short cut fusion
• Clowns to the left of me, jokers to the right (pearl)
• Exception analysis for non-strict languages
• Scrap Your Type Applications
• Implementation of Functional Languages
• Implementation of Functional Languages
• Nested data-parallelism on the gpu
• Schrödinger’s Zebra: Applying Mutual Information Maximization to Graphical Halftoning
• Functional programming through deep time
• Functional array fusion
• Adaptive lock-free maps: purely-functional to scalable
• Efficient communication and collection with compact normal forms
• Causal commutative arrows
• Push versus pull-based loop fusion in query engines
• Events in Haskell, and how to implement them
• Skeleton composition versus stable process systems in Eden
• Title not available (Why is that?)

This page was built for software: GHC