Adjunction of semifunctors: Categorical structures in nonextensional lambda calculus

DOI10.1016/0304-3975(85)90062-3MaRDI QIDQ1075312zbMATH OpenOpenAlexWikidataFDO

Authors Susumu Hayashi

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

zbMATH Keywords

cartesian closed categoriesScott embedding

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40) Categorical logic, topoi (03G30) Adjoint functors (universal constructions, reflective subcategories, Kan extensions, etc.) (18A40) Closed categories (closed monoidal and Cartesian closed categories, etc.) (18D15)

Recommendations

• Categorical models for non-extensional λ-calculi and combinatory logic
• A remark on the theory of semi-functors
• scientific article
• scientific article; zbMATH DE number 3904559
• scientific article; zbMATH DE number 4010480

Cites work

• scientific article; zbMATH DE number 3811536 (Why is no real title available?)
• scientific article; zbMATH DE number 3959364 (Why is no real title available?)
• scientific article; zbMATH DE number 3594275 (Why is no real title available?)
• scientific article; zbMATH DE number 3367095 (Why is no real title available?)
• Models of the lambda calculus
• Pre-adjunctions and lambda-algebraic theories
• The lambda calculus, its syntax and semantics

Cited in

(21)

• scientific article; zbMATH DE number 130890 (Why is no real title available?)
• Semantics of the second order lambda calculus
• Semiseparable functors and conditions up to retracts
• Categorical models for non-extensional λ-calculi and combinatory logic
• Logic of refinement types
• A categorical understanding of environment machines
• A concrete categorical semantics of lambda-\(\mathcal{S}\)
• On the semantics of second order lambda calculus: From bruce-meyer-mitchell models to hyperdoctrine models and vice-versa
• Compact inverse categories
• Pre-adjunctions and lambda-algebraic theories
• Retracing some paths in categorical semantics: from process-propositions-as-types to categorified reals and computers
• A category-theoretic characterization of functional completeness
• Adjunction in the absence of identity
• Monoidal computer. III: A coalgebraic view of computability and complexity (extended abstract)
• The theory of semi-functors
• Pre-adjunctions in order enriched categories
• On Church's formal theory of functions and functionals. The - calculus: Connections to higher type recursion theory, proof theory, category theory
• scientific article; zbMATH DE number 7449983 (Why is no real title available?)
• A remark on the theory of semi-functors
• CATEGORICAL MODEL CONSTRUCTION FOR PROVING SYNTACTIC PROPERTIES
• Comparing models of the intensional typed -calculus

This page was built for publication: Adjunction of semifunctors: Categorical structures in nonextensional lambda calculus

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1075312)