GHC
From MaRDI portal
Cited in
(only showing first 100 items - show all)- Type inference for variant object types
- Eager and delayed contract monitoring for call-by-value and call-by-name evaluation
- Functional programming through deep time: modeling the first complex ecosystems on earth
- Warnings for pattern matching
- Random generation of closed simply typed λ-terms: A synergy between logic programming and Boltzmann samplers
- From natural semantics to C: A formal derivation of two STG machines
- Harnessing the multicores: nested data parallelism in Haskell
- On termination, confluence and consistent CHR-based type inference
- scientific article; zbMATH DE number 1231611 (Why is no real title available?)
- Composable scheduler activations for Haskell
- Maintaining a library of formal mathematics
- scientific article; zbMATH DE number 1376308 (Why is no real title available?)
- Nominal unification with letrec and environment-variables
- Safe zero-cost coercions for Haskell
- scientific article; zbMATH DE number 1953332 (Why is no real title available?)
- Preserving Sharing in the Partial Evaluation of Lazy Functional Programs
- Automatic SIMD vectorization for Haskell
- scientific article; zbMATH DE number 1538021 (Why is no real title available?)
- Directly reflective meta-programming
- scientific article; zbMATH DE number 1046620 (Why is no real title available?)
- scientific article; zbMATH DE number 2086498 (Why is no real title available?)
- Polar type inference with intersection types and \(\omega\)
- Syntactic composition of top-down tree transducers is short cut fusion
- Ruler: Programming Type Rules
- Scoped dynamic rewrite rules
- Dynamic optimization for functional reactive programming using generalized algebraic data types
- A principled approach to operating system construction in Haskell
- Costing stepwise refinements of parallel programs
- Executable relational specifications of polymorphic type systems using Prolog
- Complexity bounds for container functors and comonads
- System FC with explicit kind equality
- Haskell type constraints unleashed
- 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
- Clowns to the left of me, jokers to the right (pearl)
- Optimistic evaluation
- Semantic labelling for proving termination of combinatory reduction systems
- Exception analysis for non-strict languages
- Principality and type inference for intersection types using expansion variables
- Scrap Your Type Applications
- DrScheme
- Stratego
- BABEL
- ATERM
- Haskell
- TAMPR
- OCaml
- Alfalfa
- GUM
- Shake
- cminor
- Symgrid
- UniForM
- TXL
- HTab
- OPERA
- FranTk
- RepLib
- criterion
- Freja
- HyLoTab
- Hat
- Hood
- Naira
- Nikola
- Yampa
- PAST
- HilbK3
- KIDS
- NESL
- HyLoBan
- 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
This page was built for software: GHC
