Home
About
Advanced Search
Browse by Discipline
Scientific Societies
E-print Alerts
Add E-prints
FAQ
•
HELP
•
SITE MAP
•
CONTACT US
Search
Advanced Search
Murawski, Andrzej - Computing Laboratory, University of Oxford
About the undecidability of program equivalence in finitary languages with state
Nominal Games and Full Abstraction for the NuCalculus S. Abramsky
On Program Equivalence in Languages with GroundType References Andrzej S. Murawski #
ThirdOrder Idealized Algol with Iteration is Andrzej S. Murawski 1# and Igor Walukiewicz 2##
On Semantic and Type-Theoretic Aspects of Polynomial-Time
Exhausting Strategies, Joker Games and Full Completeness for IMLL with Unit
Fast Verification of MLL Proof Nets via IMLL ANDRZEJ S. MURAWSKI and C.H. LUKE ONG
Games for complexity of secondorder callbyname programs
Discreet Games, Light Ane Logic and PTIME Computation
Dominator Trees and Fast Verification of Proof Nets A. S. Murawski C.H. L. Ong y
Functions with local state: regularity and undecidability
Syntactic Control of Concurrency # D. R. Ghica, A. S. Murawski and C.H. L. Ong
A Linear-time Algorithm for Verifying MLL Proof Nets
Full abstraction without synchronization Andrzej S. Murawski1
Applying Game Semantics to Compositional Software Modeling and Veri cation ?
Block structure vs scope extrusion: between innocence and omniscience
Full Abstraction for Reduced ML Andrzej S. Murawski and Nikos Tzevelekos
Bad variables under control Andrzej S. Murawski
Collapsible Pushdown Automata and Recursion Schemes A. S. Murawski
Reachability games and game semantics: comparing nondeterministic programs ANDRZEJ S. MURAWSKI
