Pre-adjunctions in order enriched categories

DOI10.1017/S0960129500001262zbMath0755.18003MaRDI QIDQ4006227

No author found.

Publication date: 26 September 1992

Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)

zbMATH Keywords

functionalisomorphismspecificationsconcurrentuniversal constructionspre-adjunctionapplications to programming languagesorder enriched categoryordering on homsetsproceduralrefinement ordering between programs

Mathematics Subject Classification ID

Adjoint functors (universal constructions, reflective subcategories, Kan extensions, etc.) (18A40) Theory of programming languages (68N15) Specification and verification (program logics, model checking, etc.) (68Q60) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to category theory (18-01)

Related Items (4)

A recursion theorem for predicate transformers on inductive data types ⋮ Towards patterns for heaps and imperative lambdas ⋮ The virtues of eta-expansion ⋮ Predicate transformers and higher-order programs

Cites Work

• Bicategories of spans and relations
• Adjunction of semifunctors: Categorical structures in nonextensional lambda calculus
• Local adjunctions
• Soft adjunction between 2-categories
• Coherent Extensions and Relational Algebras
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Pre-adjunctions in order enriched categories