Abstract
We investigate methods and tools for analysing translations between programming languages with respect to observational semantics. The behaviour of programs is observed in terms of may- and must-convergence in arbitrary contexts, and adequacy of translations, i.e., the reflection of program equivalence, is taken to be the fundamental correctness condition. For compositional translations we propose a notion of convergence equivalence as a means for proving adequacy. This technique avoids explicit reasoning about contexts, and is able to deal with the subtle role of typing in implementations of language extensions.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
The Alice Project (2007). Saarland University, http://www.ps.uni-sb.de/alice}
Carayol, A., Hirschkoff, D., Sangiorgi, D.: On the representation of McCarthy’s amb in the pi-calculus. Theoret. Comput. Sci. 330(3), 439–473 (2005)
De Nicola, R., Hennessy, M.: Testing equivalences for processes. Theoret. Comput. Sci. 34, 83–133 (1984)
Felleisen, M.: On the expressive power of programming languages. Sci. Comput. Programming 17(1–3), 35–75 (1991)
Gordon, A.D.: Bisimilarity as a theory of functional programming. Theoret. Comput. Sci. 228(1–2), 5–47 (1999)
Kutzner, A., Schmidt-Schauß, M.: A nondeterministic call-by-need lambda calculus. In: Proc. ICFP, pp. 324–335. ACM (1998)
Matthews, J., Findler, R.B.: Operational semantics for multi-language programs. In: 34th ACM POPL, pp. 3–10. ACM (2007)
McCusker, G.: Full abstraction by translation. In: Advances in Theory and Formal Methods of Computing. IC Press (1996)
Milner, R.: Fully abstract models of typed lambda calculi. Theoret. Comput. Sci. 4(1), 1–22 (1977)
Mitchell, J.C.: On abstraction and the expressive power of programming languages. Sci. Comput. Programming 21(2), 141–163 (1993)
Niehren, J., Sabel, D., Schmidt-Schauß, M., Schwinghammer, J.: Observational semantics for a concurrent lambda calculus with reference cells and futures. Electron. Notes Theor. Comput. Sci. 173, 313–337 (2007)
Niehren, J., Schwinghammer, J., Smolka, G.: A concurrent lambda calculus with futures. Theoret. Comput. Sci. 364(3), 338–356 (2006)
Peyton Jones, S., Gordon, A., Finne, S.: Concurrent Haskell. In: 23rd ACM POPL, pp. 295–308. ACM (1996)
Pitts, A.D.: Parametric polymorphism and operational equivalence. Math. Structures Comput. Sci. 10, 321–359 (2000)
Riecke, J.G.: Fully abstract translations between functional languages. In: 18th ACM POPL, pp. 245–254. ACM (1991)
Ritter, E., Pitts, A.M.: A fully abstract translation between a lambda-calculus with reference types and Standard ML. In: Proc. 2nd TLCA, pp. 397–413. Springer (1995)
Sabel, D., Schmidt-Schauß, M.: A call-by-need lambda-calculus with locally bottom-avoiding choice: Context lemma and correctness of transformations. Math. Structures Comput. Sci. (2008). Accepted for publication
Sanjabi, S.B., Ong, C.H.L.: Fully abstract semantics of additive aspects by translation. In: Proc. 6th OASD, pp. 135–148. ACM (2007)
Schmidt-Schauß, M., Niehren, J., Schwinghammer, J., Sabel, D.: Adequacy of compositional translations for observational semantics. Technical report Frank-33, J.W.Goethe Universität, Frankfurt (2008)
Shapiro, E.: Separating concurrent languages with categories of language embeddings. In: 23rd ACM STOC, pp. 198–208. ACM (1991)
Søndergaard, H., Sestoft, P.: Non-determinism in functional languages. Comput. J. 35(5), 514–523 (1992)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 IFIP International Federation for Information Processing
About this paper
Cite this paper
Schmidt-Schauß, M., Niehren, J., Schwinghammer, J., Sabel, D. (2008). Adequacy of Compositional Translations for Observational Semantics. In: Ausiello, G., Karhumäki, J., Mauri, G., Ong, L. (eds) Fifth Ifip International Conference On Theoretical Computer Science – Tcs 2008. IFIP International Federation for Information Processing, vol 273. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-09680-3_35
Download citation
DOI: https://doi.org/10.1007/978-0-387-09680-3_35
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-09679-7
Online ISBN: 978-0-387-09680-3
eBook Packages: Computer ScienceComputer Science (R0)