Linear Realizability

DOI10.1007/978-3-540-74915-8_32zbMATH Open1179.03068OpenAlexW2913601947MaRDI QIDQ3608428FDOQ3608428

Authors: Naohiko Hoshino 

Publication date: 5 March 2009

Published in: Computer Science Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-74915-8_32

Recommendations

• scientific article; zbMATH DE number 65803
• Linearization and compactness
• Higher-order linearisability
• Higher-order linearisability
• scientific article; zbMATH DE number 4010303
• scientific article; zbMATH DE number 1215498
• Elementary realizability
• Linearly realizable automata
• On the complexity of linearizability

Mathematics Subject Classification ID

Substructural logics (including relevance, entailment, linear logic, Lambek calculus, BCK and BCI logics) (03B47) Other algebras related to logic (03G25) Categorical logic, topoi (03G30) BCK-algebras, BCI-algebras (06F35)

Cited In (9)

• Realizability models for a linear dependent PCF
• Generalized bounded linear logic and its categorical semantics
• Realizations and LP
• Title not available (Why is that?)
• Ordered combinatory algebras and realizability
• Title not available (Why is that?)
• Semantics of higher-order quantum computation via geometry of interaction
• Logical foundations of quantitative equality
• Linear realizability and full completeness for typed lambda-calculi

This page was built for publication: Linear Realizability

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