GHC
From MaRDI portal
Cited in
(only showing first 100 items - show all)- Stratego
- DrScheme
- BABEL
- ATERM
- TAMPR
- Haskell
- Complexity bounds for container functors and comonads
- Derivation and inference of higher-order strictness types
- A short cut to optimal sequences
- A purely functional computer algebra system embedded in Haskell
- OCaml
- Type inference for variant object types
- Principality and type inference for intersection types using expansion variables
- Easy composition of symbolic computation software using SCSCP: a new Lingua Franca for symbolic computation
- Dual analysis for proving safety and finding bugs
- Nominal unification with letrec and environment-variables
- Shake
- Alfalfa
- Symgrid
- GUM
- cminor
- Maintaining a library of formal mathematics
- UniForM
- TXL
- HTab
- A survey of strategies in rule-based program transformation systems
- Selective strictness and parametricity in structural operational semantics, inequationally
- FranTk
- RepLib
- criterion
- HyLoTab
- Freja
- Hat
- Hood
- Yampa
- Naira
- Nikola
- PAST
- HilbK3
- Maude versus Haskell: An experimental comparison in security protocol analysis
- KIDS
- scientific article; zbMATH DE number 1691456 (Why is no real title available?)
- scientific article; zbMATH DE number 1692893 (Why is no real title available?)
- Executable relational specifications of polymorphic type systems using Prolog
- Computing cup products in integral cohomology of Hilbert schemes of points on K3 surfaces
- Fusing logic and control with local transformations: an example optimization
- Scoped dynamic rewrite rules
- OPERA
- Polar type inference with intersection types and
- NESL
- Language-based program verification via expressive types
- Using Maude and its strategies for defining a framework for analyzing Eden semantics
- Using Template Haskell for abstract interpretation
- On termination, confluence and consistent CHR-based type inference
- Dynamic optimization for functional reactive programming using generalized algebraic data types
- A principled approach to operating system construction in Haskell
- Exception analysis for non-strict languages
- HyLoBan
- Adaptive lock-free maps: purely-functional to scalable
- Efficient communication and collection with compact normal forms
- Sequent calculus as a compiler intermediate language
- Regular expression pattern matching for XML
- Harnessing the multicores: nested data parallelism in Haskell
- Manticore
- CoCo
- Comprehending Ringads
- Clowns to the left of me, jokers to the right (pearl)
- Lucid
- Hugs
- TIL
- Eden
- EdenTV
- Lambada
- H/Direct
- GCJNI
- GreenCard
- FFI
- Ruler: Programming Type Rules
- Unbound
- HNT
- FreshOCaml
- GCminor
- MLCompCert
- Warnings for pattern matching
- A call-by-need lambda calculus with locally bottom-avoiding choice: context lemma and correctness of transformations
- Scrap Your Type Applications
- Semantic labelling for proving termination of combinatory reduction systems
- Haskell type constraints unleashed
- HALO
- Kleisli
- computational-algebra
- type-natural
- ghc-typelits-presburger
- DoCon
- scientific article; zbMATH DE number 1376308 (Why is no real title available?)
- DBToaster
- LiquidHaskell
- scientific article; zbMATH DE number 53817 (Why is no real title available?)
- Links
- Nix
This page was built for software: GHC
