This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
H. P. Barendregt, The Lambda-Calculus: Its Syntax and Semantics, North-Holland, 1981.
J. L. Bates and R. L. Constable, Proofs as Programs, ACM Trans. Prog. Lang. and Systems 7, 1 (January 1985), 113–136.
G. Berry, Some Syntactic and Categorical Constructions of Lambda-Calculus Models, INRIA Rapport de Recherche No. 80, June 1981.
G. Berry and P. L. Curien, Sequential Algorithms on Concrete Data Structures, Theoretical Computer Science,, 1982.
S. D. Brookes, C. A. R. Hoare and A. W. Roscoe, A Theory of Communicating Sequential Processes, J. ACM 31, 3 (July 1984), 560–599.
R. M. Burstall and J. A. Goguen, Putting Theories Together To Make Specifications, 5th International Joint Conference on Artificial Intelligence,, 1977, 1045–1058.
R. L. Constable and D. R. Zlatin, The Type Theory of PL/CV3, ACM Trans. Prog. Lang. and Systems 6, 1 (January 1984), 94–117.
M. P. Fourman, The Logic of Topoi, in Handbook of Mathematical Logic, J. Barwise (ed.), North-Holland, 1977, 1054–1090.
R. Goldblatt, Topoi: the Categorial Analysis of Logic, North-Holland, 1979.
M. J. Gordon, A. J. Milner and C. P. Wadsworth, Edinburgh LCF, in Lecture Notes in Computer Science, Vol. 78, Springer, Berlin, 1979.
P. T. Johnstone, Topos Theory, Academic Press, 1977.
P. T. Johnstone and R. Paré, eds., Indexed Categories and Their Applications, Springer Lecture Notes in Mathematics, 1978.
S. C. Kleene, On the Interpretation of Intuitionistic Number Theory, J. Symbolic Logic 10, (1945), 109–124.
F. W. Lawvere, Adjointness in Foundations, Dialectica 23, (1969), 281–296.
F. W. Lawvere, Quantifiers and Sheaves, in Actes des Congrés International des Mathématiques, tome I, 1970, 329–334.
F. W. Lawvere, ed., Toposes, Algebraic Geometry, and Logic, Springer Lecture Notes in Mathematics, 1972.
F. W. Lawvere, C. Maurer and G. C. Wraith, eds., Model Theory and Topoi, Springer Lecture Notes in Mathematics, 1975.
P. Martin-Löf, Constructive Mathematics and Computer Programming, 6th Int'l. Congress for Logic, Methodology, and Philosophy of Science, Hannover, Aug. 1979.
A. R. Meyer, What is a Lambda-Calculus Model?, MIT LCS/TM-171, August 1980.
D. Scott, Constructive Validity, in Proc. Symposium on Automatic Deduction, Lecture Notes in Mathematics 125, Springer-Verlag, 1970, 237–275.
D. S. Scott and C. Strachey, Toward a Mathematical Semantics for Computer Languages, in Proc. Symposium on Computers and Automata, J. Fox (ed.), Polytechnic Institute of New York, New York, 1971, 19–46.
D. Scott, Data Types as Lattices, SIAM J. Comput. 5, 3 (Sept. 1976), 522–587.
M. B. Smyth and G. D. Plotkin, The Category-Theoretic Solution of Recursive Domain Equations, Proc. 18th Symposium on Mathematical Foundations of Computer Science,, 1977, 13–17.
M. B. Smyth, Effectively Given Domains, Theoretical Computer Science 5, (1978),.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1986 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Shultis, J. (1986). What is a model? A consumer's perspective on semantic theory. In: Melton, A. (eds) Mathematical Foundations of Programming Semantics. MFPS 1985. Lecture Notes in Computer Science, vol 239. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-16816-8_38
Download citation
DOI: https://doi.org/10.1007/3-540-16816-8_38
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-16816-4
Online ISBN: 978-3-540-44861-7
eBook Packages: Springer Book Archive