RPO, second-order contexts, and λ-calculus

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

Volumn 4962 LNCS, Issue , 2008, Pages 334-349

  Di Gianantonio, Pietro ^a   Honsell, Furio ^a   Lenisa, Marina ^a  

^a UNIVERSITY OF UDINE   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

BIOMINERALIZATION; DIFFERENTIATION (CALCULUS); FOUNDATIONS; MATHEMATICAL TECHNIQUES; STANDARDS;

BISIMILARITY; BRANCHING TRANSITION SYSTEM; COMPUTATIONAL STRUCTURES; EUROPEAN; HEIDELBERG (CO); INTERNATIONAL (CO); OBSERVATIONAL EQUIVALENCES; PROCESS CALCULUS; SECOND ORDERS; SOFTWARE SCIENCE; TRANSITION SYSTEMS; VALUE REDUCTION; WEAK BISIMILARITY;

CALCULATIONS;

EID: 47249091406     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-78499-9_24     Document Type: Conference Paper

References (16)

1. Abramsky, S., Ong, L.: Full Abstraction in the Lazy Lambda Calculus. Information and Computation 105(2), 159-267 (1993)
2. Bonchi, F., Konig, B., Montanari, U.: Saturated Semantics for Reactive Systems. In: LICS (2006)
3. Bonchi, F., Gadducci, F., Konig, B.: Process Bisimulation via a Graphical Encoding. In: Corradini, A., Ehrig, H., Montanari, U., Ribeiro, L., Rozenberg, G. (eds.) ICGT 2006. LNCS, vol. 4178, pp. 168-183. Springer, Heidelberg (2006)
4. Di Gianantonio, P., Honsell, F., Lenisa, M.: RPO, Second-order Contexts, and λ-calculus, Extended version (2008), www.dimi.uniud.it/pietro/papers/ socl.pdf
5. Egidi, L., Honsell, F., Ronchi Della Rocca, S.: Operational, Denotational and Logical Descriptions: A Case Study. Fundamenta Inf. 16(2), 149-169 (1992)
6. Ehrig, H., König, B.: Deriving bisimulation congruences in the DPO approach to graph rewriting with borrowed contexts. Mathematical Structure in Computer Science 16(6), 1133-1163 (2006)
7. Gadducci, F., Montanari, U.: Observing Reductions in Nominal Calculi via a Graphical Encoding of Processes. In: Middeldorp, A., van Oostrom, V., van Raamsdonk, F., de Vrijer, R. (eds.) Processes, Terms and Cycles: Steps on the Road to Infinity. LNCS, vol. 3838, pp. 106-126. Springer, Heidelberg (2005)
8. Hindley, R., Seldin, J.: Introduction to combinators and l-calculus. Cambridge University Press, Cambridge (1986)
9. Klin, B., Sassone, V., Sobocinski, P.: Labels from reductions: Towards a general theory. In: Fiadeiro, J.L., Harman, N.A., Roggenbach, M., Rutten, J. (eds.) CALCO 2005. LNCS, vol. 3629, pp. 30-50. Springer, Heidelberg (2005)
10. Leifer, J.: Operational congruences for reactive systems, PhD thesis, University of Cambridge Computer Laboratory (2001)
11. Leifer, J., Milner, R.: Deriving bisimulation congruences for reactive systems. In: Palamidessi, C. (ed.) CONCUR 2000. LNCS, vol. 1877, pp. 243-258. Springer, Heidelberg (2000)
12. Milner, R.: Local bigraphs and confluence: Two conjectures. In: Proc. Express 2006. ENTCS, vol. 175, pp. 65-73 (2007)
13. Sassone, V., Sobocinski, P.: Deriving bisimulation congruences: 2-categories vs precategories. In: Gordon, A.D. (ed.) FOSSACS 2003. LNCS, vol. 2620, pp. 409-424. Springer, Heidelberg (2003)
14. Sassone, V., Sobocinski, P.: Reactive systems over cospans. In: LICS 2005, pp. 311-320. IEEE, Los Alamitos (2005)
15. Sewell, P.: From rewrite rules to bisimulation congruences. Theoretical Computer Science 274(1-2), 183-230 (2002)
16. Sobocinski, P.: Deriving process congruences from reduction rules, PhD thesis, University of Aarhus (2004)