GHC

swMATH6691MaRDI QIDQ18773FDOQ18773

Author name not available (Why is that?)

Official website: http://www.haskell.org/haskellwiki/GHC

Described by source

• Secrets of the Glasgow Haskell Compiler inliner

Cited In (only showing first 100 items - show all)

• Eager and delayed contract monitoring for call-by-value and call-by-name evaluation
• Title not available (Why is that?)
• Maintaining a library of formal mathematics
• Ruler: Programming Type Rules
• Dynamic optimization for functional reactive programming using generalized algebraic data types
• Executable relational specifications of polymorphic type systems using Prolog
• System FC with explicit kind equality
• Optimistic evaluation
• Principality and type inference for intersection types using expansion variables
• OCaml
• Title not available (Why is that?)
• Alfalfa
• GUM
• Shake
• cminor
• Symgrid
• UniForM
• TXL
• HTab
• OPERA
• FranTk
• RepLib
• criterion
• Freja
• HyLoTab
• Hat
• Hood
• Naira
• Nikola
• Yampa
• PAST
• HilbK3
• KIDS
• NESL
• HyLoBan
• 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
• HALO
• CoCo
• Manticore
• Hugs
• Lucid
• Eden
• EdenTV
• FFI
• GCJNI
• GreenCard
• H/Direct
• Lambada
• FreshOCaml
• GCminor
• HNT
• MLCompCert
• TIL
• Unbound
• Kleisli
• computational-algebra
• DoCon
• ghc-typelits-presburger
• DBToaster
• type-natural
• LiquidHaskell
• Links
• Nix
• Volcano
• Async
• HaLVM
• Lwt
• Muesli
• MultiMLton
• MzLib
• Vector
• Ruler
• Bazel
• Buck
• Dune
• fabricate
• Incremental
• Ninja
• Reflow
• redo
• SOL
• A certified framework for compiling and executing garbage-collected languages
• Binders unbound
• Programming in Haskell
• Dual analysis for proving safety and finding bugs
• Title not available (Why is that?)
• Program transformation with scoped dynamic rewrite rules
• Principal Type Inference for GHC-Style Multi-parameter Type Classes
• Generic multiset programming with discrimination-based joins and symbolic Cartesian products
• Sequent calculus as a compiler intermediate language
• Composition of functions with accumulating parameters
• HTab: a terminating tableaux system for hybrid logic
• Experiments in theorem proving for topological hybrid logic
• A purely functional computer algebra system embedded in Haskell
• Regular expression pattern matching for XML
• A short cut to optimal sequences
• Type inference for variant object types
• Warnings for pattern matching

This page was built for software: GHC