Dr Paulo Oliva

Profile

I am a computer scientist with a PhD in Theoretical Computer Science. I am currently a Reader in Mathematical Logic, with expertise in System Verification, Game Theory, Formal Logic, and Constructive Mathematics.

Teaching

Functional Programming (Postgraduate)

Practical introduction to functional programming for students with good programming ability but no prior knowledge of FP

Functional Programming (Undergraduate)

Recent approaches to systems programming frequently involve functional programming either overtly in the sense that they use modern functional programming languages for rapid prototyping, or more covertly in that they use techniques developed in the functional setting as a way of lending greater structure and clarity to code. This module gives a structured introduction to programming in modern industrial functional languages such as Haskell and F# and to techniques such as map-reduce and monadic programming.

Web Programming (Undergraduate)

Many computer systems are now accessed through a web interface. This module provides an in-depth and practical study of techniques for programming the web. Students will become proficient in a modern web development framework using PHP for sever programming and Javascript for client programming. The strengths and weaknesses of the framework are evaluated considering issues including authentication, security, session management, cross languages (PHP, SQL, Javascript) consistency and abstraction of the server-client interface. Different architecture styles are compared, including REST and AJAX and the use of JSON. Techniques for testing and for engineering web systems that behave robustly under high load are also covered.

Research

Research Interests:

My main area of research is in mathematical logic and proof theory. In particular, I am interested in the computational content of mathematical proofs. What do theorems tell us, apart from the truth they convey? How can proofs be viewed as programs, so as to be executed, and how can programs be viewed as proofs, so that their correctness can be automatically checked? These questions become highly non-trivial when proofs involve classical logic, induction and analytical principles such as countable choice and WKL.

Recently, I have also been working on the application of formal verification to the domain of continuous systems. More precisely, developing 'Hoare logic' systems in order to prove properties of systems in the continuous time domain.

My early research career was on the topic of algorithms. That was the time when I was taking part in the ACM ICPC (International Collegiate Programming Challenge). My first paper was on pattern matching algorithms, jointly written with K. Guimaraes and E. W. Myers.

Publications

• Oliva P, Arthan R (2020). Double Negation Semantics for Generalisations of Heyting Algebras. nameOfConference

  
  

  DOI: 10.1007/s11225-020-09909-y

  
  

  QMRO: https://qmro.qmul.ac.uk/xmlui/handle/123456789/64467
• Andrew L-S, Oliva P, Robinson E (2020). Kripke Semantics for Intuitionistic Lukasiewicz Logic. nameOfConference

  
  

  DOI: 10.1007/s11225-020-09908-z

  
  

  QMRO: https://qmro.qmul.ac.uk/xmlui/handle/123456789/64072
• Oliva P, Xu C (2020). On the Herbrand functional interpretation. nameOfConference

  
  

  DOI: 10.1002/malq.201900067

  
  

  QMRO: https://qmro.qmul.ac.uk/xmlui/handle/123456789/62083
• Oliva P, Arthan R (2019). Studying Algebraic Structures Using Prover9 and Mace4. nameOfConference

  
  

  DOI: 10.1007/978-3-030-28483-1_5

  
  

  QMRO: https://qmro.qmul.ac.uk/xmlui/handle/123456789/61310
• Berardi S, Oliva P, Steila S (2019). An analysis of the Podelski-Rybalchenko termination theorem via bar recursion. nameOfConference

  
  

  DOI: 10.1093/logcom/exv058

  
  

  QMRO: https://qmro.qmul.ac.uk/xmlui/handle/123456789/31913
• BORGES OLIVA P, Steila S (2018). A direct proof of Schwichtenberg's bar recursion closure theorem. nameOfConference

  
  

  DOI: 10.1017/jsl.2017.33

  
  

  QMRO: https://qmro.qmul.ac.uk/xmlui/handle/123456789/22422
• BORGES OLIVA P, Escardo M (2017). The Herbrand Functional Interpretation of the Double Negation Shift. nameOfConference

  
  

  DOI: 10.1017/jsl.2017.8

  
  

  QMRO: https://qmro.qmul.ac.uk/xmlui/handle/123456789/22039
• Hedges J, Oliva P, Shprits E et al. (2016). Selection Equilibria of Higher-Order Games. PRACTICAL ASPECTS OF DECLARATIVE LANGUAGES

  
  

  DOI: 10.1007/978-3-319-51676-9_9

  
  

  QMRO: https://qmro.qmul.ac.uk/xmlui/handle/123456789/25211
• Oliva P, Powell T (2016). Bar recursion over finite partial functions. nameOfConference

  
  

  DOI: 10.1016/j.apal.2016.11.003

  
  

  QMRO: https://qmro.qmul.ac.uk/xmlui/handle/123456789/31912
• Oliva P, Ferreira G (2011). Functional interpretations of intuitionistic linear logic. nameOfConference

  
  

  DOI: 10.2168/LMCS-7(1:9)2011

  
  

  QMRO: qmroHref
• Oliva P (2010). Hybrid functional interpretations of linear and intuitionistic logic. nameOfConference

  
  

  DOI: 10.1093/logcom/exq007

  
  

  QMRO: qmroHref
• Arthan R, Martin U, Mathiesen EA et al. (2007). Reasoning about linear systems. nameOfConference

  
  

  DOI: 10.1109/sefm.2007.13

  
  

  QMRO: qmroHref
• Ferreira F, Oliva P (2005). Bounded functional interpretation. nameOfConference

  
  

  DOI: 10.1016/j.apal.2004.11.001

  
  

  QMRO: qmroHref
• Berger U, Oliva P (2005). Modified bar recursion and classical dependent choice. nameOfConference

  
  

  DOI: doi

  
  

  QMRO: qmroHref
• Oliva P (2003). Polynomial-time algorithms from ineffective proofs. nameOfConference

  
  

  DOI: 10.1109/lics.2003.1210052

  
  

  QMRO: qmroHref
• Oliva P, Kohlenbach U (2003). Proof mining: A systematic way of analyzing proofs in mathematics. nameOfConference

  
  

  DOI: doi

  
  

  QMRO: qmroHref
• Oliva P (2002). On the computational complexity of best L-1-approximation. nameOfConference

  
  

  DOI: 10.1002/1521-3870(200210)48:1+<66::AID-MALQ66>3.0.CO;2-Y

  
  

  QMRO: qmroHref