The following pages link to Categorical combinators (Q3745827):
Displaying 19 items.
- Quasi-prime algebraic domains (Q672133) (← links)
- Semantics of the typed \(\lambda\)-calculus with substitution in a cartesian closed category (Q687575) (← links)
- A category-theoretic characterization of functional completeness (Q912587) (← links)
- Alpha conversion, conditions on variables and categorical logic (Q913792) (← links)
- Functional programming with combinators (Q1098628) (← links)
- Church-Rosser theorem for a rewriting system on categorical combinators (Q1119562) (← links)
- On Church's formal theory of functions and functionals. The \(\lambda\)- calculus: Connections to higher type recursion theory, proof theory, category theory (Q1120558) (← links)
- A notation for lambda terms. A generalization of environments (Q1129257) (← links)
- A proof of the substitution lemma in de Bruijn's notation (Q1802059) (← links)
- Simply typed lambda calculus with first-class environments (Q1894315) (← links)
- A formalized general theory of syntax with bindings: extended version (Q1984791) (← links)
- Reverse AD at higher types: pure, principled and denotationally correct (Q2233481) (← links)
- (Q2744122) (← links)
- Physics, Topology, Logic and Computation: A Rosetta Stone (Q3000920) (← links)
- λν, a calculus of explicit substitutions which preserves strong normalisation (Q3125228) (← links)
- (Q3142163) (← links)
- Categories with Families: Unityped, Simply Typed, and Dependently Typed (Q5014596) (← links)
- (Q5111329) (← links)
- (Q5137919) (← links)