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.
KeywordsNatural Transformation Full Subcategory Monoidal Category Left Adjoint Monoidal Functor
Unable to display preview. Download preview PDF.
- Hoshino, N.: Linear realizability. Master’s thesis, Kyoto University (2007)Google Scholar
- Joyal, A., Street, R., Verity, D.: Traced monoidal categories. Math. Proc. Cambridge Phil. Soc. 119(3) (1996)Google Scholar
- Kleene, S.C., Vesley, R.E.: The Foundations of Intuitionistic Mathematics, especially in relation to recursive functions. North-Holland, Amsterdam (1965)Google Scholar
- Longley, J.: Realizability Toposes and Language Semantics. PhD thesis, Edinburgh University (1995)Google Scholar
- Simpson, A.K.: Reduction in a linear lambda-calculus with applications to operational semantics. In: Giesl, J. (ed.) RTA 2005. LNCS, vol. 3467, pp. 219–234. Springer, Heidelberg (2005)Google Scholar