Typed normal form bisimulation

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4646 LNCS, Issue , 2007, Pages 283-297

  Lassen, Soren B ^a   Levy, Paul Blain ^b  

^a GOOGLE INC   (United States)

^b UNIVERSITY OF BIRMINGHAM   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING; RECURSIVE FUNCTIONS; SEMANTICS; TREES (MATHEMATICS);

BOEHM TREE EQUIVALENCE; FIXED POINT OPERATORS; NORMAL FORM BISIMULATION; SYNTACTIC MINIMAL INVARIANCE;

COMPUTATION THEORY;

EID: 38049005899     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-74915-8_23     Document Type: Conference Paper

References (33)

1. Sangiorgi, D.: The lazy lambda calculus in a concurrency scenario. Information and Computation 111(1), 120-153 (1994)
2. Jagadeesan, R., Pitcher, C., Riely, J.: Open bisimulation for aspects. In: Intl. Conf. on Aspect-Oriented Software Development, ACM, pp. 209-224. ACM Press, New York (2007)
3. Lassen, S.B.: Bisimulation in untyped lambda calculus: Böhm trees and bisimulation up to context. In: MFPS XV. ENTCS, vol. 20, pp. 346-374. Elsevier, Amsterdam (1999)
4. Lassen, S.B.: Eager normal form bisimulation. In: 20th LICS, pp. 345-354. IEEE Computer Society Press, Los Alamitos (2005)
5. Lassen, S.B.: Normal form simulation for McCarty's amb. In: MFPS XXI. ENTCS, vol. 155, pp. 445-465. Elsevier, Amsterdam (2005)
6. Lassen, S.B.: Head normal form bisimulation for pairs and the λμ-calculus. In: 21st LICS, pp. 297-306. IEEE Computer Society Press, Los Alamitos (2006) (extended abstract)
7. Støvring, K., Lassen, S.B.: A complete, co-inductive syntactic theory of sequential control and state. In: 34th POPL, pp. 63-74. ACM Press, New York (2007)
8. Abramsky, S.: The lazy λ-calculus. In: Turner, D. (ed.) Research Topics in Functional Programming, pp. 65-116. Addison-Wesley, Reading (1990)
9. Gordon, A.D.: Functional Programming and Input/Output. CUP (1994)
10. Levy, P.B.: Call-By-Push-Value. A Functional/Imperative Synthesis. In: Semantic Struct, in Computation, Springer, Heidelberg (2004)
11. Levy, P.B.: Adjunction models for call-by-push-value with stacks. Theory and Applications of Categories 14(5), 75-110 (2005)
12. Merro, M., Biasi, C.: On the observational theory of the CPS calculus. In: MFPS XXII. ENTCS, vol. 158, pp. 307-330. Elsevier, Amsterdam (2006)
13. Hyland, J.M.E., Ong, C.H.L.: On full abstraction for PCF: I, II, and III. Information and Computation 163(2), 285-408 (2000)
14. Abramsky, S., McCusker, G.: Call-by-value games. In: Nielsen, M. (ed.) CSL 1997. LNCS, vol. 1414, pp. 1-17. Springer, Heidelberg (1998)
15. Abramsky, S., Honda, K., McCusker, G.: A fully abstract game semantics for general references. In: 13th LICS, pp. 334-344. IEEE Computer Society Press, Los Alamitos (1998)
16. Laird, J.: Full abstraction for functional languages with control. In: 12th LICS, pp. 58-67. IEEE Computer Society Press, Los Alamitos (1997)
17. Ker, A.D., Nickau, H., Ong, C.H.L.: Innocent game models of untyped lambdacalculus. Theoretical Computer Science 272(1-2), 247-292 (2002)
18. Ker, A.D., Nickau, H., Ong, C.H.L.: Adapting innocent game models for the Böhm tree A-theory. Theoretical Computer Science 308(1-3), 333-366 (2003)
19. Ong, C.H.L., Gianantonio, P.D.: Games characterizing Lévy-Longo trees. Theoretical Computer Science 312(1), 121-142 (2004)
20. Laird, J.: A categorical semantics of higher-order store. In: 9th Conference on Category Theory and Computer Science. ENTCS, vol. 69, Elsevier, Amsterdam (2003)
21. Curien, P.L., Herbelin, H.: Computing with abstract Böhm trees. In: Fuji International Symposium on Functional and Logic Programming, pp. 20-39 (1998)
22. Danos, V., Herbelin, H., Régnier, L.: Game semantics and abstract machines. In: 11th LICS, pp. 394-405. IEEE Computer Society Press, Los Alamitos (1996)
23. Levy, P.B.: Infinite trace equivalence. In: MFPS XXI. ENTCS, vol. 155, pp. 467-496. Elsevier, Amsterdam (2006)
24. Levy, P.B.: Game semantics using function inventories.Talk given at Geometry of Computation 2006, Marseille (2006)
25. Laird, J.: A fully abstract trace semantics for general references. In: 34th ICALP. LNCS, vol. 4596, Springer, Heidelberg (2007)
26. Hyland, J.M.E., Ong, C.H.L.: Pi-calculus, dialogue games and PCF. In: 7th FPCA, pp. 96-107. ACM Press, New York (1995)
27. Fiore, M.P., Honda, K.: Recursive types in games: Axiomatics and process representation. In: 13th LICS, pp. 345-356. IEEE Computer Society Press, Los Alamitos (1998)
28. Thielecke, H.: Categorical Structure of Continuation Passing Style. PhD thesis, University of Edinburgh (1997)
29. Thielecke, H.: Contrasting exceptions and continuations. Unpublished (October 2001)
30. Barendregt, H.P.: The Lambda Calculus: Its Syntax and Semantics. Revised edn., North-Holland, Amsterdam (1984)
31. Pitts, A.M.: Relational properties of domains. Information and Computation 127, 66-90 (1996)
32. Birkedal, L., Harper, R.: Operational interpretations of recursive types in an operational setting (summary). In: Ito, T., Abadi, M. (eds.) TACS 1997. LNCS, vol. 1281, Springer, Heidelberg (1997)
33. Lassen, S.B.: Relational reasoning about contexts. In: Gordon, A.D., Pitts, A.M. (eds.) Higher Order Operational Techniques in Semantics.CUP, pp. 91-135 (1998)