MFPSExploratory functions on nondeterministic strategies, up to lower bisimilarity ? Paul Blain Levy1 Kidane Yemane Weldemariam2 University of Birmingham, Birmingham, B15 2TT, UK

Source URL: www.cs.bham.ac.uk

• Deduction
• Entailment
• Logical consequence
• Logical syntax
• Metalogic
• Valuation
• Lambda calculus
• Natural deduction
• Holomorphic functional calculus
• Logic
• Abstract algebra
• Mathematics

Similarity Quotients as Final Coalgebras Paul Blain Levy⋆ University of Birmingham, UK

Source URL: www.cs.bham.ac.uk

• Order theory
• Algebraic topology
• F-coalgebra
• Coalgebra
• Partially ordered set
• Preorder
• Equivalence relation
• Functor
• Presentation of a group
• Mathematics
• Abstract algebra
• Category theory

A tutorial on call-by-push-value Paul Blain Levy University of Birmingham October 12, 2013

Source URL: www.cs.bham.ac.uk

• Computer science
• Programming language semantics
• Models of computation
• Type theory
• Lambda calculus
• Denotational semantics
• Type system
• Evaluation strategy
• Operational semantics
• Theoretical computer science
• Applied mathematics
• Logic in computer science

Modal properties of recursively defined commands Paul Blain Levy, University of Birmingham And {s.As }s∈A∗ means: A recent paper (“Seeing Beyond Divergence”,

Source URL: www.cs.bham.ac.uk

• Models of computation
• Order theory
• Philosophical logic
• Computability theory
• Equivalence relation
• Lambda calculus
• Preorder
• Modal logic
• Denotational semantics
• Mathematics
• Logic
• Mathematical logic

Typed Normal Form Bisimulation Soren B. Lassen1 and Paul Blain Levy2 1 2

Source URL: www.cs.bham.ac.uk

• Logic in computer science
• Lambda calculus
• Process calculi
• Π-calculus
• Bisimulation
• Combinatory logic
• Fixed-point combinator
• Sheaf
• Theoretical computer science
• Applied mathematics
• Mathematics

Jumbo λ-Calculus Paul Blain Levy University of Birmingham Abstract. We make an argument that, for any study involving computational effects such as divergence or continuations, the traditional syntax of simply typed lam

Source URL: www.cs.bham.ac.uk

MFPS XX1 Preliminary Version Infinite Trace Equivalence Paul Blain Levy 1

Source URL: www.cs.bham.ac.uk

Nondeterminism, fixpoints and bisimulation Paul Blain Levy University of Birmingham November 12, 2010

Source URL: www.cs.bham.ac.uk

Limitations of Applicative Bisimulation (Preliminary Report) Vasileios Koutavas?1 , Paul Blain Levy2 and Eijiro Sumii3 1 Trinity College Dublin

Source URL: drops.dagstuhl.de

Amb breaks well-pointedness, ground amb doesn’t Paul Blain Levy School of Computer Science, University of Birmingham, UK Amb breaks well-pointedness, ground amb doesn’t – p. 1/21

Source URL: www.cs.bham.ac.uk