Abstract
We present a strategy for obtaining extensional (partial) combinatory algebras by slightly modifying the well-known construction of graph models for the untyped lambda calculus. Using the notion of weak cartesian closed category an elegant interpretation of our construction in a category theoretical setting is given.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
H.P. Barendregt[1984] The Lambda Calculus. Its Syntax and Semantics. Nort-Holland.
I. Bethke[1986] How to construct extensional combinatory algebras. Indagationes Mathematicae 89: 243–257.
I. Bethke[1987] On the existence of extensional partial combinatory algebras. Journal of Symbolic Logic 52–3.
S. Hayashi[1985] Adjunction of semi-functors: categorical structures in non-extensional lambda calculus. Theoretical Computer Science 45: 95–104.
R. Hoofman[1990/1] Continuous information systems. Department of Computer Science, Utrecht University, preprint RUU-CS-90-25
R. Hoofman[1990/2] Linear logic, domain theory and semi-functors. Department of Computer Science, Utrecht University, preprint RUU-CS-90-34.
R. Hoofman[1991] A note on semi-adjunctions. Department of Computer Science, Utrecht University, preprint RUU-CS-91-41.
R. Hoofman[1992] Ph.D.-thesis. Department of Computer Science, Utrecht University.
R. Hoofman & H. Schellinx[1991] Collapsing graph models by preorders. ITLI — Prepublication Series for Mathematical Logic and Foundations, University of Amsterdam, ML-91-04.
J.L. Krivine[1990] Lambda-calcul, Types et Modèles. Masson.
S. MacLane[1971] Categories for the Working Mathematician. Springer Verlag.
S. Martini[1987] An interval model for second order lambda calculus. In: D.H. Pitt, A. Poigné & D. Rydeheard (eds.), Category Theory and Computer Science, Edinburgh 1987. LNCS vol. 283, Springer Verlag.
H. Schellinx[1991] Isomorphisms and non-isomorphisms of graph models. Journal of Symbolic Logic 56-1: 227–249
D.Scott[1982] Domains for denotational semantics. In: M. Nielsen & E.M. Schmidt (eds.), Automata, Languages and Programming. Ninth Colloquium, Aarhus 1982. LNCS vol.140, Springer Verlag.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hoofman, R., Schellinx, H. (1991). Collapsing graph models by preorders. In: Pitt, D.H., Curien, PL., Abramsky, S., Pitts, A.M., Poigné, A., Rydeheard, D.E. (eds) Category Theory and Computer Science. CTCS 1991. Lecture Notes in Computer Science, vol 530. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0013457
Download citation
DOI: https://doi.org/10.1007/BFb0013457
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-54495-1
Online ISBN: 978-3-540-38413-7
eBook Packages: Springer Book Archive