Publisher
Springer Berlin Heidelberg
Reference35 articles.
1. Abramsky, S., Haghverdi, E., Scott, P.J.: Geometry of interaction and linear combinatory algebras. Math. Struct. in Comput. Sci. 12(5), 625–665 (2002)
2. Lecture Notes in Computer Science;S Abramsky,2000
3. Abramsky, S., Lenisa, M.: Linear realizability and full completeness for typed lambda-calculi. Ann. Pure Appl. Logic 134(2–3), 122–168 (2005)
4. Asperti, A.: Stability and computability in coherent domains. Inf. Comput. 86, 115–139 (1990)
5. Bauer, A.: The Realizability Approach to Computable Analysis and Topology. Ph.D. thesis, School of Computer Science, Carnegie Mellon University (2000)