Adjunction of semifunctors: Categorical structures in nonextensional lambda calculus
From MaRDI portal
Publication:1075312
DOI10.1016/0304-3975(85)90062-3zbMath0592.03010OpenAlexW2092954762WikidataQ56445468 ScholiaQ56445468MaRDI QIDQ1075312
Publication date: 1985
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(85)90062-3
Adjoint functors (universal constructions, reflective subcategories, Kan extensions, etc.) (18A40) Categorical logic, topoi (03G30) Closed categories (closed monoidal and Cartesian closed categories, etc.) (18D15) Combinatory logic and lambda calculus (03B40)
Related Items (16)
The theory of semi-functors ⋮ Categorical models for non-extensional λ-calculi and combinatory logic ⋮ Pre-adjunctions in order enriched categories ⋮ Semantics of the second order lambda calculus ⋮ On Church's formal theory of functions and functionals. The \(\lambda\)- calculus: Connections to higher type recursion theory, proof theory, category theory ⋮ Adjunction in the absence of identity ⋮ On the semantics of second order lambda calculus: From bruce-meyer-mitchell models to hyperdoctrine models and vice-versa ⋮ A remark on the theory of semi-functors ⋮ Logic of refinement types ⋮ A category-theoretic characterization of functional completeness ⋮ Unnamed Item ⋮ Comparing models of the intensional typed \(\lambda\)-calculus ⋮ Monoidal computer III: a coalgebraic view of computability and complexity (extended abstract) ⋮ Unnamed Item ⋮ CATEGORICAL MODEL CONSTRUCTION FOR PROVING SYNTACTIC PROPERTIES ⋮ A categorical understanding of environment machines
Cites Work
This page was built for publication: Adjunction of semifunctors: Categorical structures in nonextensional lambda calculus
