• case-insensitive prefix search: default
  e.g., sig matches "SIGIR" as well as "signal"
• exact word search: append dollar sign ($) to word
  e.g., graph$ matches "graph", but not "graphics"
• boolean and: separate words by space
  e.g., codd model
• boolean or: connect words by pipe symbol (|)
  e.g., graph|network

Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.

found 20 matches

• 2016
• 
  Arthur Azevedo de Amorim:
  Binding Operators for Nominal Sets. MFPS 2016: 3-27
• 
  Marc Bagnol, Richard Blute, J. Robin B. Cockett, J. S. Lemay:
  The Shuffle Quasimonad and Modules with Differentiation and Integration. MFPS 2016: 29-45
• 
  Tyler Barker:
  A Monad for Randomized Algorithms. MFPS 2016: 47-62
• 
  Lars Birkedal:
  Preface. MFPS 2016: 1-2
• 
  J. Robin B. Cockett, Jonathan Gallagher:
  Categorical Models of the Differential λ-Calculus Revisited. MFPS 2016: 63-83
• 
  Fredrik Dahlqvist, Vincent Danos, Ilias Garnier:
  Giry and the Machine. MFPS 2016: 85-110
• 
  Jonas Frey:
  Classical Realizability in the CPS Target Language. MFPS 2016: 111-126
• 
  Bram Geron, Paul Blain Levy:
  Iteration and Labelled Iteration. MFPS 2016: 127-146
• 
  Sergey Goncharov, Stefan Milius, Christoph Rauch:
  Complete Elgot Monads and Coalgebraic Resumptions. MFPS 2016: 147-168
• 
  Bart Jacobs:
  Effectuses from Monads. MFPS 2016: 169-183
• 
  Bart Jacobs, Fabio Zanasi:
  A Predicate/State Transformer Semantics for Bayesian Learning. MFPS 2016: 185-200
• 
  Tomas Jakl, Achim Jung, Ales Pultr:
  Bitopology and Four-valued Logic. MFPS 2016: 201-219
• 
  Barry Jay:
  Programs as Data Structures in λSF-Calculus. MFPS 2016: 221-236
• 
  David Mestel, A. W. Roscoe:
  Reducing Complex CSP Models to Traces via Priority. MFPS 2016: 237-252
• 
  Jurriaan Rot:
  Coalgebraic Minimization of Automata by Initiality and Finality. MFPS 2016: 253-276
• 
  Tetsuya Sato:
  Approximate Relational Hoare Logic for Continuous Random Samplings. MFPS 2016: 277-298
• 
  Rick Statman:
  On the Representation of Semigroups and Other Congruences in the Lambda Calculus. MFPS 2016: 299-304
• 
  Rick Statman:
  How to Think of Intersection Types as Cartesian Products. MFPS 2016: 305-312
• 
  Fabio Zanasi:
  The Algebra of Partial Equivalence Relations. MFPS 2016: 313-333
• 
  Lars Birkedal:
  The Thirty-second Conference on the Mathematical Foundations of Programming Semantics, MFPS 2016, Carnegie Mellon University, Pittsburgh, PA, USA, May 23-26, 2016. Electronic Notes in Theoretical Computer Science 325, Elsevier 2016 [contents]