Parallelism in realizability models

DOI10.1007/978-3-031-39784-4_18MaRDI QIDQ6199588

Satoshi Nakata

Publication date: 28 February 2024

Published in: Logic, Language, Information, and Computation (Search for Journal in Brave)

zbMATH Keywords

realizabilitypartial combinatory algebraparallel-or function

Mathematics Subject Classification ID

Logic in computer science (03B70)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Linear realizability and full completeness for typed lambda-calculi
• The lambda calculus. Its syntax and semantics. Rev. ed.
• Realizability. An introduction to its categorical side
• Generalized Banach-Mazur functionals in the topos of recursive sets
• Call-by-name, call-by-value and the \(\lambda\)-calculus
• LCF considered as a programming language
• From term models to domains
• Relative computability in the effective topos
• A uniform approach to domain theory in realizability models
• Head reduction and normalization in a call-by-value lambda-calculus
• More on Geometric Morphisms between Realizability Toposes
• On the interpretation of intuitionistic number theory

This page was built for publication: Parallelism in realizability models