E. A. Ashcroft
- 1 ANDERSON, E.R., BELZ, F.C., AND BLUM, E.K. Issues in the formal specification of programming languages. In Formal Description of Programming Concepts, E.J. Neuhold (Ed.). Elsevier North- Holland, New York, 1978, pp. 1-30.Google Scholar
- 2 ASHCROFT, E.A., AND WADCE, W.W. Structured Lucid. Tech. Rep. CS-79-21, Computer Science Dep., Univ. of Waterloo, Ontario, 1979.Google Scholar
- 3 ASHCROFT, E.A., AND WADCE, W.W. Lucid, a nonprocedural language with iteration. Commun. ACM 20, 7 (July 1977), 519-526. Google Scholar
- 4 As~cRo~r, E.A., AND WADGE, W.W. Lucid--A formal system for writing and proving programs. SIAM J. Comput. 5, 3 (1976), 519-526.Google Scholar
- 5 CHURCH, A. The calculi of lambda-conversion. Annals of Mathematical Studies No. 6. Princeton University Press, 1941. Google Scholar
- 6 DENNIS, J. Opening remarks. In Formal Description of Programming Concepts, E.J. Neuhold (Ed.). Elsevier North-Holland, New York, 1978, pp. xi-xvii.Google Scholar
- 7 DIJKSTRA, E.W. A somewhat open letter to EAA. EWD 614, Burroughs Corp., AL Nuenen, Netherlands, Mar. 1977.Google Scholar
- 8 DIJKSTRA, E.W. A Discipline of Programming. Prentice-HaU, Englewood Cliffs, N.J., 1976. Google Scholar
- 9 DIJKSTRA, E.W. Go to statement considered harmful. Commun. ACM 11, 3 (Mar. 1968), 147-148. Google Scholar
- 10 FRIEDMAN, D., AND WISE, D. Applicative multiprogramming. Tech. Rep. 72, Computer Science Dep., Indiana Univ., Bloomington, 1979.Google Scholar
- 11 GORDON, M. The Denotational Description of Programming Languages. Springer-Verlag, New York, 1979. Google Scholar
- 12 GORDON, M. Operational reasoning and denotational semantics. In Proc. IRIA Conf. on Proving and Improving Programs (Colloques Institut de Recherche d'Informatique et d'Automatique Arc et Senans, France), 1975, pp. 83-98.Google Scholar
- 13 GORDON, M., MILNER, R., MORRIS, L., NEWEY, M., AND WADSWORTH, C. A metalanguage for interactive proof in LCF. Tech. Rep. CSR-16-77, Dep. of Computer Science, Univ. of Edinburgh, Scotland, 1977.Google Scholar
- 14 HOAR~, C.A.R. Communicating sequential processes. Commun. ACM21, 8 (Aug. 1978), 666-677. Google Scholar
- 15 KAHN, G., AND McQUEEN, D.B. Coroutines and networks of parallel processes. In Proc. IFIP Congress 77, Elsevier North-Holland, 1977, pp. 993-998.Google Scholar
- 16 KLEENE, S.C. Introduction to Meta Mathematics. Van Nostrand Reinhold, Florence, Ky., 1952.Google Scholar
- 17 KOWALSKI, R.A. Logic for Problem Solving. Elsevier North-Holland, New York, 1979. Google Scholar
- 18 LANDIN, P.J. The next 700 programming languages. Commun. ACM 9, 3 (Mar. 1966), 157-166. Google Scholar
- 19 MCCARTHY, J., ABRAHAMS, P.W., EDWARDS, D.J., HART, T.P., AND LEVIN, M.I. LISP 1.5 Programmer's Manual. M.I.T. Press, Cambridge, Mass., 1962. Google Scholar
- 20 MAY, M.D., TAYLOR, R.J.B., AND WHITBY-STREVENS, C. EPL: An experimental language for distributed computing. In Trends and Applications: Distributed Processing--Proceedings, National Bureau of Standards, U.S. Government Printing Office, Washington, D.C., May 1978, pp. 69-71.Google Scholar
- 21 MILNE, R., AND STRACHEY, C. A Theory of Programming Language Semantics. Chapman and Hall, London, England, 1976. Google Scholar
- 22 PLOTK1N, G.D. A power domain construction. SIAM J. Comput. 5, 3 (1976), 452-487.Google Scholar
- 23 RICHARDS, M. The portability of the BCPL compiler. Softw. Pract. Exper. 1, 2 (1971), 135-146.Google Scholar
- 24 SCOTT, D.S. Data types as lattices. SIAM J. Comput. 5, 3 (1976), 522-587.Google Scholar
- 25 SCOTT, D.S., AND STRACHEY, C. Toward a mathematical semantics for computer languages. In MRI Symposium Proceedings, vol. 21: Proceedings of the Symposium on Computers and Automata, Fox, J. (Ed.). Polytechnic Press, Polytechnic Institute of Brooklyn, New York, 1971, pp. 19-46.Google Scholar
- 26 STOY, J.E. Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory. M.I.T. Press, Cambridge, Mass., 1977. Google Scholar
- 27 TENNENT, R.D. Language design methods based on semantic principles. Acta Inf. 8 (1977), 97-112.Google Scholar
- 28 TENNENT, R.D. The denotational semantics of programming languages. Commun. ACM 19, 8 (Aug. 1976), 437-453. Google Scholar
- 29 TU~ER, D.A. A new implementation technique for applicative languages. Softw. Pract. Exper. 8 (1979), 31-49.Google Scholar
- 30 VUlLLEMI~, J. Correct and optimal implementations of recursion in a simple programming language. In Conference Record of 5th Annual ACM Symposium on Theory of Computing, Austin, Tex., April 30-May 2, 1973, pp. 224-239. Google Scholar
Index Terms
- R for Semantics
Recommendations
Enriching the semantics of variational geometric constraint data with ontology
Lack of explicit semantics in the product data to be exchanged among product development systems is a major problem for existing product data exchange standards. To solve this problem, the semantics of product data should be enriched to form a basis for ...
Formal semantics-preserving translation from fuzzy ER model to fuzzy OWL DL ontology
Ontology is an important part of the W3C standards for the Semantic Web, and how to quickly and cheaply construct Web ontologies has become a key technology to enable the Semantic Web. However, information imprecision and uncertainty exist in many real-...
Enriching OWL with instance recognition semantics for automated semantic annotation
ER'07: Proceedings of the 2007 conference on Advances in conceptual modeling: foundations and applicationsAlthough OWL provides a solid basis for many semantic-web applications, it lacks sufficient declarative semantics for instance recognition. This omission prevents OWL from being a satisfactory ontology language for automated semantic annotation. We can ...
Comments