Realizability in ordered combinatory algebras with adjunction
From MaRDI portal
Publication:4623132
DOI10.1017/S0960129518000075zbMath1456.03025OpenAlexW2800760800MaRDI QIDQ4623132
Octavio Malherbe, Mauricio German Guillermo, Walter Ricardo Ferrer Santos
Publication date: 19 February 2019
Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s0960129518000075
Categorical logic, topoi (03G30) Preorders, orders, domains and lattices (viewed as categories) (18B35) Combinatory logic and lambda calculus (03B40)
Related Items (1)
Cites Work
- Combinatory logic. With two sections by William Craig.
- Realizability. An introduction to its categorical side
- Dependent choice, `quote' and the clock
- All realizability is relative
- Tripos theory
- Ordered partial combinatory algebras
- Krivine's classical realisability from a categorical perspective
- Typed lambda-calculus in classical Zermelo-Fraenkel set theory
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Realizability in ordered combinatory algebras with adjunction