The following pages link to (Q4945244):
Displaying 37 items.
- Map fusion for nested datatypes in intensional type theory (Q627204) (← links)
- Substitution in non-wellfounded syntax with variable binding (Q703526) (← links)
- A principled approach to programming with nested types in Haskell (Q848745) (← links)
- Explicit substitutions and higher-order syntax (Q853744) (← links)
- Type-based termination of generic programs (Q923883) (← links)
- Modules over monads and initial semantics (Q964503) (← links)
- Iteration and coiteration schemes for higher-order and nested datatypes (Q1770412) (← links)
- Confluence of the coinductive \(\lambda\)-calculus (Q1884931) (← links)
- Nested abstract syntax in Coq (Q1945918) (← links)
- A formalized general theory of syntax with bindings: extended version (Q1984791) (← links)
- Rensets and renaming-based recursion for syntax with bindings (Q2104549) (← links)
- From signatures to monads in \textsf{UniMath} (Q2319990) (← links)
- Strongly typed term representations in Coq (Q2392480) (← links)
- Containers: Constructing strictly positive types (Q2566024) (← links)
- Indexed induction-recursion (Q2577476) (← links)
- Modelling parallel quantum computing using transactional memory (Q2825358) (← links)
- Quantum arrows in Haskell (Q2870213) (← links)
- Turing-Completeness Totally Free (Q2941179) (← links)
- A Mechanized Theory of Regular Trees in Dependent Type Theory (Q2945653) (← links)
- Partiality, Revisited (Q2988390) (← links)
- Some Domain Theory and Denotational Semantics in Coq (Q3183523) (← links)
- (Q3384910) (← links)
- Heterogeneous Substitution Systems Revisited (Q4580223) (← links)
- Monotone (co)inductive types and positive fixed-point types (Q4943545) (← links)
- (Q5009703) (← links)
- A type- and scope-safe universe of syntaxes with binding: their semantics and proofs (Q5019018) (← links)
- A Functional Abstraction of Typed Invocation Contexts (Q5043596) (← links)
- High-level signatures and initial semantics (Q5079724) (← links)
- Verifying Selective CPS Transformation for Shift and Reset (Q5098734) (← links)
- (Q5101336) (← links)
- Indexed containers (Q5371943) (← links)
- 2-Dimensional Directed Type Theory (Q5739362) (← links)
- Semantic analysis of normalisation by evaluation for typed lambda calculus (Q5889884) (← links)
- Typing with Leftovers - A mechanization of Intuitionistic Multiplicative-Additive Linear Logic (Q6060672) (← links)
- Rensets and renaming-based recursion for syntax with bindings extended version (Q6111524) (← links)
- The formal theory of relative monads (Q6496517) (← links)
- Towards the complexity analysis of programming language proof methods (Q6605344) (← links)
