The following pages link to Data types à la carte (Q3520165):
Displaying 17 items.
- Introducing \(\llparenthesis\lambda\rrparenthesis\), a \(\lambda \)-calculus for effectful computation (Q831147) (← links)
- Executable component-based semantics (Q1734523) (← links)
- Combining deep and shallow embedding of domain-specific languages (Q1749137) (← links)
- Classical misuse attacks on NIST round 2 PQC. The power of rank-based schemes (Q2229273) (← links)
- Modular Dependent Induction in Coq, Mendler-Style (Q2829276) (← links)
- Fusion for Free (Q2941182) (← links)
- Asymptotic Improvement of Computations over Free Monads (Q3521997) (← links)
- (Q5014449) (← links)
- A type- and scope-safe universe of syntaxes with binding: their semantics and proofs (Q5019018) (← links)
- (Q5020618) (← links)
- Doo bee doo bee doo (Q5110934) (← links)
- Modularity and Implementation of Mathematical Operational Semantics (Q5166622) (← links)
- A representation theorem for second-order functionals (Q5371942) (← links)
- Interleaving data and effects (Q5371955) (← links)
- No value restriction is needed for algebraic effects and handlers (Q5372003) (← links)
- Functional Semantics (Q5410451) (← links)
- Proving confluence in the confluence framework with confident (Q6622001) (← links)
