Parallelism in realizability models

DOI10.1007/978-3-031-39784-4_18MaRDI QIDQ6199588zbMATH OpenFDO

Authors Satoshi Nakata

Publication date 28 February 2024

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

Full work available at URL https://doi.org/10.1007/978-3-031-39784-4_18

zbMATH Keywords

parallel-or functionpartial combinatory algebrarealizability

Mathematics Subject Classification ID

Logic in computer science (03B70)

Cites work

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

This page was built for publication: Parallelism in realizability models

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