Semantics: the description of computational structures
Pages 173 - es
Abstract
No abstract available.
Supplementary Material
PS File (a173-riecke.ps)
- Download
- 77.28 KB
References
[1]
Abramsky, S. 1994. Interaction categories and communicating sequential processes. In W. Roscoe Ed., A classical mind: essays in honour of C.A.R. Hoare, pp. 1{16. Prentice- Hall.
[2]
Abramsky, S., Malacaria, P., and Jagadeesan, R. 1994. Full abstraction for PCF (extended abstract). In M. Hagiya and J. Mitchell Eds., Theoretical Aspects of Computer Software (1994), pp. 1{15. Springer-Verlag.
[3]
Berry, G. 1995. The constructive semantics of pure Esterel. Unpublished manuscript.
[4]
Cardelli, L. 1995. A language with distributed scope. Computing Systems 8, 1, 27{59.
[5]
Fournet, C. and Gonthier, G. 1996. The re exive CHAM and the join-calculus. In Conference Record of the Twenty-Third Annual ACM Symposium on Principles of Programming Languages (1996), pp. 372{385. ACM.
[6]
Girard, J.-Y. 1971. Une extension de l'interpr~etation de G.odel ~ a l'analyse, et son application ~ a l'~elimination des coupures dans l'analyse et la th~eorie des types. In J. E. Fenstad Ed., Proceedings of the Second Scandinavian Logic Symposium, Volume 63 of Studies in Logic and the Foundations of Mathematics (1971), pp. 63{92. North-Holland.
[7]
Goldstine, H. H. and von Neumann, J. 1947. Planning and coding of problems for an electronic computing instrument. Part II, Volume 1 of a report prepared for the U.S. Army Ordnance Department.
[8]
Harper, R. and Lillibridge, M. 1994. A type-theoretic approach to higher-order modules and sharing. In Conference Record of the Twenty-First Annual ACM Symposium on Principles of Programming Languages (1994), pp. 123{137. ACM.
[9]
Hyland, J. and Ong, C.-H. L. 1995. Pi-calculus, dialogue games and PCF. In 7th Annual ACM Conference onFunctional Programming Languages and Computer Architecture, La Jolla, California (1995).
[10]
Jones, C. B. 1992. The search for tractable ways of reasoning about programs. Technical Report UMCS-92-4-4, University of Manchester.
[11]
Landin, P. J. 1965. A correspondence between algol 60 and Church's lambda notation. Commun. ACM 8, 89{101; 158{165.
[12]
Leroy, X. 1995. Applicative functors and fully transparent higher-order modules. In Conference Record of the Twenty-Second Annual ACM Symposium on Principles of Programming Languages (1995), pp. 142{153. ACM.
[13]
Milner, R. 1996. Calculi for interaction. Acta Informatica. To appear.
[14]
Mitchell, J. C. 1986. Representation independence and data abstraction. In Conference Record of the Thirteenth Annual ACM Symposium on Principles of Programming Languages (1986), pp. 263{276. ACM.
[15]
Nickau, H. 1994. Hereditarily sequential functionals. InProceedings of the Symposium on Logical Foundations of Computer Science: Logic at St. Petersburg, Lect. Notes in Computer Sci. (1994). Springer-Verlag.
[16]
O'Hearn, P. W. and Reynolds, J. C. 1995. From Algol to polymorphic linear lambdas calculus. Lectures at Isaac Newton Institute for Mathematical Sciences, Cambridge, UK.
[17]
O'Hearn, P. W. and Riecke, J. G. 1995. Kripke logical relations and PCF. Information and Computation 120, 1, 107{116.
[18]
O'Hearn, P. W. and Tennent, R. D. 1995. Parametricity and local variables. J. ACM 42, 658{709.
[19]
Platek, R. A. Foundations of recursion theory. PhD thesis, Stanford University, 1966.
[20]
Reynolds, J. C. 1974. Towards a theory of type structure. In Proceedings Colloque sur la Programmation, Volume 19 of Lecture Notes in Computer Science (Berlin, 1974), pp. 408{425. Springer-Verlag.
[21]
Reynolds, J. C. 1983. Types, abstraction and parametric polymorphism. InR. E. A. Mason Ed., Information Processing 83, pp. 513{523. Amsterdam: North Holland.
[22]
Saraswat, V. A., Jagadeesan, R., and Gupta, V. 1994. Foundations of timed concurrent constraint programming. InProceedings, Ninth Annual IEEE Symposium on Logic in Computer Science (1994).
[23]
Scott, D. 1993. A type theoretical alternative to CUCH, ISWIM, OWHY. Theoretical Computer Sci. 121, 411{440. Published version of unpublished manuscript, Oxford University, 1969.
[24]
Sieber, K. 1992. Reasoning about sequential functions via logical relations. In Applications of Categories in Computer Science, Volume 177 of London Mathematical Society Lecture Note Series (1992). Cambridge University Press.
Recommendations
Equivalence of formal semantics definition methods
AbstractThere are numerous methods of formally defining the semantics of computer languages. Each method has been designed to fulfil a different purpose. For example, some have been designed to make reasoning about languages as easy as possible; others ...
Bi-inductive Structural Semantics
We propose a simple order-theoretic generalization of set-theoretic inductive definitions. This generalization covers inductive, co-inductive and bi-inductive definitions and is preserved by abstraction. This allows the structural operational semantics ...
Comments
Information & Contributors
Information
Published In
Copyright © 1996 ACM.
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 01 December 1996
Published in CSUR Volume 28, Issue 4es
Check for updates
Qualifiers
- Article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 271Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 23 Dec 2024