Modified Realizability Toposes and Strong Normalization Proofs
TLCA '93 Proceedings of the International Conference on Typed Lambda Calculi and Applications
What is a Categorical Model of Intuitionistic Linear Logic?
TLCA '95 Proceedings of the Second International Conference on Typed Lambda Calculi and Applications
A Mixed Linear and Non-Linear Logic: Proofs, Terms and Models (Extended Abstract)
CSL '94 Selected Papers from the 8th International Workshop on Computer Science Logic
Geometry of Interaction and linear combinatory algebras
Mathematical Structures in Computer Science
Soft linear logic and polynomial time
Theoretical Computer Science - Implicit computational complexity
Reduction in a linear lambda-calculus with applications to operational semantics
RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications
| Hi-index | 0.00 |
We define a notion of relational linear combinatory algebra (rLCA) which is a generalization of a linear combinatory algebra defined by Abramsky, Haghverdi and Scott. We also define a category of assemblies as well as a category of modest sets which are realized by rLCA. This is a linear style of realizability in a way that duplicating and discarding of realizers is allowed in a controlled way. Both categories form linear-non-linear models and their coKleisli categories have a natural number object. We construct some examples of rLCA's which have some relations to well known PCA's.