Blain - PDFSEARCH.IO - Document Search Engine

Blain
Results: 111

#	Item
11	MFPSExploratory functions on nondeterministic strategies, up to lower bisimilarity ? Paul Blain Levy1 Kidane Yemane Weldemariam2 University of Birmingham, Birmingham, B15 2TT, UK Add to Reading List Source URL: www.cs.bham.ac.uk Language: English - Date: 2009-05-18 06:36:21 Deduction Entailment Logical consequence Logical syntax Metalogic Valuation Lambda calculus Natural deduction Holomorphic functional calculus Logic Abstract algebra Mathematics
12	Similarity Quotients as Final Coalgebras Paul Blain Levy⋆ University of Birmingham, UK Add to Reading List Source URL: www.cs.bham.ac.uk Language: English - Date: 2011-04-02 14:59:57 Order theory Algebraic topology F-coalgebra Coalgebra Partially ordered set Preorder Equivalence relation Functor Presentation of a group Mathematics Abstract algebra Category theory
13	A tutorial on call-by-push-value Paul Blain Levy University of Birmingham October 12, 2013 Add to Reading List Source URL: www.cs.bham.ac.uk Language: English - Date: 2013-10-21 08:35:46 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
14	Modal properties of recursively defined commands Paul Blain Levy, University of Birmingham And {s.As }s∈A∗ means: A recent paper (“Seeing Beyond Divergence”, Add to Reading List Source URL: www.cs.bham.ac.uk Language: English - Date: 2008-07-23 07:52:00 Models of computation Order theory Philosophical logic Computability theory Equivalence relation Lambda calculus Preorder Modal logic Denotational semantics Mathematics Logic Mathematical logic
15	Typed Normal Form Bisimulation Soren B. Lassen1 and Paul Blain Levy2 1 2 Add to Reading List Source URL: www.cs.bham.ac.uk Language: English - Date: 2007-12-20 12:37:08 Logic in computer science Lambda calculus Process calculi Π-calculus Bisimulation Combinatory logic Fixed-point combinator Sheaf Theoretical computer science Applied mathematics Mathematics
16	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 Add to Reading List Source URL: www.cs.bham.ac.uk - Date: 2007-05-03 10:47:11
17	MFPS XX1 Preliminary Version Infinite Trace Equivalence Paul Blain Levy 1 Add to Reading List Source URL: www.cs.bham.ac.uk Language: English - Date: 2007-05-03 10:47:16
18	Nondeterminism, fixpoints and bisimulation Paul Blain Levy University of Birmingham November 12, 2010 Add to Reading List Source URL: www.cs.bham.ac.uk Language: English - Date: 2010-11-12 07:32:52
19	Limitations of Applicative Bisimulation (Preliminary Report) Vasileios Koutavas?1 , Paul Blain Levy2 and Eijiro Sumii3 1 Trinity College Dublin Add to Reading List Source URL: drops.dagstuhl.de Language: English - Date: 2010-11-04 11:03:40
20	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 Add to Reading List Source URL: www.cs.bham.ac.uk Language: English - Date: 2007-05-03 10:47:20