Search the dblp DataBase
Paul Blain Levy :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
Paul Blain Levy Possible World Semantics for General Storage in Call-By-Value. [Citation Graph (0, 0)][DBLP ] CSL, 2002, pp:232-246 [Conf ] Paul Blain Levy Infinite trace equivalence. [Citation Graph (0, 0)][DBLP ] GALOP, 2005, pp:195-209 [Conf ] Paul Blain Levy Jumbo lambda -Calculus. [Citation Graph (0, 0)][DBLP ] ICALP (2), 2006, pp:444-455 [Conf ] Paul Blain Levy Call-by-Push-Value: A Subsuming Paradigm. [Citation Graph (0, 0)][DBLP ] TLCA, 1999, pp:228-242 [Conf ] Paul Blain Levy Adjunction Models For Call-By-Push-Value With Stacks. [Citation Graph (0, 0)][DBLP ] Electr. Notes Theor. Comput. Sci., 2002, v:69, n:, pp:- [Journal ] Paul Blain Levy Infinite Trace Equivalence. [Citation Graph (0, 0)][DBLP ] Electr. Notes Theor. Comput. Sci., 2006, v:155, n:, pp:467-496 [Journal ] Paul Blain Levy Monads and Adjunctions for Global Exceptions. [Citation Graph (0, 0)][DBLP ] Electr. Notes Theor. Comput. Sci., 2006, v:158, n:, pp:261-287 [Journal ] Paul Blain Levy Infinitary Howe's Method. [Citation Graph (0, 0)][DBLP ] Electr. Notes Theor. Comput. Sci., 2006, v:164, n:1, pp:85-104 [Journal ] Paul Blain Levy Amb Breaks Well-Pointedness, Ground Amb Doesn't. [Citation Graph (0, 0)][DBLP ] Electr. Notes Theor. Comput. Sci., 2007, v:173, n:, pp:221-239 [Journal ] Paul Blain Levy , John Power , Hayo Thielecke Modelling environments in call-by-value programming languages. [Citation Graph (0, 0)][DBLP ] Inf. Comput., 2003, v:185, n:2, pp:182-210 [Journal ] Paul Blain Levy Call-by-push-value: Decomposing call-by-value and call-by-name. [Citation Graph (0, 0)][DBLP ] Higher-Order and Symbolic Computation, 2006, v:19, n:4, pp:377-414 [Journal ] Martin Hyland , Paul Blain Levy , Gordon D. Plotkin , John Power Combining algebraic effects with continuations. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2007, v:375, n:1-3, pp:20-40 [Journal ] Søren B. Lassen , Paul Blain Levy Typed Normal Form Bisimulation. [Citation Graph (0, 0)][DBLP ] CSL, 2007, pp:283-297 [Conf ] Typed Normal Form Bisimulation for Parametric Polymorphism. [Citation Graph (, )][DBLP ] Infinite trace equivalence. [Citation Graph (, )][DBLP ] Global State Considered Helpful. [Citation Graph (, )][DBLP ] Exploratory Functions on Nondeterministic Strategies, up to Lower Bisimilarity. [Citation Graph (, )][DBLP ] Search in 0.001secs, Finished in 0.002secs