The following pages link to GHC (Q18773):
Displaying 42 items.
- Generic multiset programming with discrimination-based joins and symbolic Cartesian products (Q656874) (← links)
- Eager and delayed contract monitoring for call-by-value and call-by-name evaluation (Q710673) (← links)
- Directly reflective meta-programming (Q848742) (← links)
- Costing stepwise refinements of parallel programs (Q875957) (← links)
- Complexity bounds for container functors and comonads (Q1640987) (← links)
- Derivation and inference of higher-order strictness types (Q1749138) (← links)
- A short cut to optimal sequences (Q1758658) (← links)
- A purely functional computer algebra system embedded in Haskell (Q1798330) (← links)
- Type inference for variant object types (Q1854549) (← links)
- Principality and type inference for intersection types using expansion variables (Q1884929) (← links)
- Easy composition of symbolic computation software using SCSCP: a new Lingua Franca for symbolic computation (Q1930155) (← links)
- Dual analysis for proving safety and finding bugs (Q1951646) (← links)
- Nominal unification with letrec and environment-variables (Q2119105) (← links)
- Maintaining a library of formal mathematics (Q2219408) (← links)
- A survey of strategies in rule-based program transformation systems (Q2456575) (← links)
- Selective strictness and parametricity in structural operational semantics, inequationally (Q2464947) (← links)
- (Q2703702) (← links)
- (Q2763378) (← links)
- (Q2763633) (← links)
- Executable Relational Specifications of Polymorphic Type Systems Using Prolog (Q2798266) (← links)
- Computing cup products in integral cohomology of Hilbert schemes of points on K3 surfaces (Q2804224) (← links)
- Fusing Logic and Control with Local Transformations (Q2841226) (← links)
- Scoped Dynamic Rewrite Rules (Q2841252) (← links)
- Polar Type Inference with Intersection Types and ω (Q2842834) (← links)
- Language-Based Program Verification via Expressive Types (Q2866340) (← links)
- Using Maude and Its Strategies for Defining a Framework for Analyzing Eden Semantics (Q2866804) (← links)
- Using Template Haskell for Abstract Interpretation (Q2873799) (← links)
- On Termination, Confluence and Consistent CHR-based Type Inference (Q2931268) (← links)
- Dynamic optimization for functional reactive programming using generalized algebraic data types (Q2936767) (← links)
- A principled approach to operating system construction in Haskell (Q2936775) (← links)
- Exception analysis for non-strict languages (Q2949196) (← links)
- Adaptive lock-free maps: purely-functional to scalable (Q2981963) (← links)
- Efficient communication and collection with compact normal forms (Q2981988) (← links)
- Sequent calculus as a compiler intermediate language (Q2982003) (← links)
- Regular expression pattern matching for XML (Q3160299) (← links)
- (Q3165976) (← links)
- Comprehending Ringads (Q3188283) (← links)
- Clowns to the left of me, jokers to the right (pearl) (Q3189847) (← links)
- Ruler: Programming Type Rules (Q3434622) (← links)
- An abstract monadic semantics for value recursion (Q4659889) (← links)
- HTab: a Terminating Tableaux System for Hybrid Logic (Q4982111) (← links)
- Experiments in Theorem Proving for Topological Hybrid Logic (Q4982128) (← links)
