Result 1 to 14 of 14 total
Avoiding shared clocks in networks of timed automata. (English)
Koutny, Maciej (ed.) et al., CONCUR 2012 ‒ concurrency theory. 23rd international conference, CONCUR 2012, Newcastle upon Tyne, UK, September 4‒7, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-32939-5/pbk). Lecture Notes in Computer Science 7454, 100-114 (2012).
1
Branching vs. linear time: semantical perspective. (English)
Bezem, Marc (ed.), Computer science logic (CSL’11). 25th international workshop, 20th annual conference of the EACSL, Bergen, Norway, September 12‒15, 2011. Wadern: Schloss Dagstuhl ‒ Leibniz Zentrum für Informatik (ISBN 978-3-939897-32-3). LIPICS ‒ Leibniz International Proceedings in Informatics 12, 3, electronic only (2011).
2
Characterizing contextual equivalence in calculi with passivation. (English)
Inf. Comput. 209, No. 11, 1390-1433 (2011).
3
Simulation in the call-by-need lambda-calculus with letrec. (English)
Lynch, Christopher (ed.), Proceedings of the 21st international conference on rewriting techniques and applications (RTA 2010), July 11‒13, 2010, Edinburgh, Scottland, UK. Wadern: Schloss Dagstuhl ‒ Leibniz Zentrum für Informatik (ISBN 978-3-939897-18-7). LIPICS ‒ Leibniz International Proceedings in Informatics 6, 295-310, electronic only (2010).
4
A bisimulation-like proof method for contextual properties in untyped $λ$-calculus with references and deallocation. (English)
Theor. Comput. Sci. 411, No. 51-52, 4358-4378 (2010).
5
Similarity implies equivalence in a class of non-deterministic call-by-need lambda calculi. (English)
Inf. Comput. 208, No. 3, 276-291 (2010).
6
A bisimulation for dynamic sealing. (English)
Theor. Comput. Sci. 375, No. 1-3, 169-192 (2007).
7
Securing the .NET programming model. (English)
Theor. Comput. Sci. 364, No. 3, 311-317 (2006).
8
A theory of operational equivalence for interaction nets. (English)
Gonnet, Gastón H. (ed.) et al., LATIN 2000: Theoretical informatics. 4th Latin American symposium, Punta del Este, Uruguay, April 10-14, 2000. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1776, 447-456 (2000).
9
Mechanized operational semantics via (co)induction. (English)
Bertot, Yves (ed.) et al., Theorem proving in higher order logics. 12th international conference, TPHOLs ’99. Nice, France, September 14-17, 1999. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1690, 221-238 (1999).
10
The theory of fexprs is trivial. (English)
LISP Symb. Comput. 10, No. 3, 189-199 (1998).
11
Operational reasoning for functions with local state. (English)
Gordon, Andrew D. (ed.) et al., Higher order operational techniques in semantics. Papers from the HOOTS workshop, Cambridge, UK, October 1995. Cambridge: Cambridge University Press. Publ. Newton Inst. 12, 227-273 (1998).
12
A note on logical relations between semantics and syntax. (English)
Log. J. IGPL 5, No.4, 589-601 (1997).
13
An extensional partial combinatory algebra based on $λ$-terms. (English)
Mathematical foundations of computer science, Proc. 16th Int. Symp., Kazimierz Dolny/Pol. 1991, Lect. Notes Comput. Sci. 520, 387-396 (1991).
14
Result 1 to 14 of 14 total
Start
Contact
Print
General Help
