[TYPES/announce] PhD Studentship at UCL: A Coalgebraic framework for reductive logic and proof-search
[ The Types Forum (announcements only),
http://lists.seas.upenn.edu/mailman/listinfo/types-announce ]
[Apologies for cross-postings: please circulate widely. Thank you.]
PhD Studentship: A Coalgebraic framework for reductive logic and proof-search
We are seeking to appoint a PhD student in UCL’sProgramming Principles, Logic,
and Verification (PPLV, http://pplv.cs.ucl.ac.uk/welcome/) group,to work
alongside the EPSRC-funded project “A coalgebraic framework for reductive logic
and proof-search (ReLiC)”.
See https://gow.epsrc.ukri.org/NGBOViewGrant.aspx?GrantRef=EP/S013008/1
The project is led by David Pym (PI), Alexandra Silva, and Simon Docherty
(Co-Is). Facebook (Peter O’Hearn) is a partner in the project.
The position is available from 23 September 2019 for 4 years. The starting
stipend will be approximately £17,280, with an approximate annual uplift of 3%.
We are looking for a talented, highly motivated student interested in working
on some aspects of the project. Here is a description of the project.
The traditional treatment of logic is that of a deductive science: from axioms,
conclusions are deduced according to formal proof rules. However, in practice
many applications of logic and mathematical reasoning proceed in the opposite
direction: from a putative conclusion, one finds sufficient axioms from which
it may be concluded. This proceeds not by a step-by-step application of proof
rules, but instead by the systematic reduction of the space of possible
(deductive) proofs. We call this the reductive approach to logic. Archetypal
examples of reductive reasoning in computer science include automated theorem
proving, logic programming languages such as PROLOG, and precondition inference
in program verification.
The ReLiC project aims to produce a uniform mathematical foundation for
reductive logic via the framework of coalgebra and coinduction. Coalgebra can
fruitfully be seen as a unifying formalism for stateful systems, while
coinduction is a closely connected proof principle based on the reduction of
goals into subgoals. In doing so we aim to
(1) deepen the theoretical understanding of reductive logic, facilitating a
broadening of the applicability of such techniques;
(2) implement prototype provers and automated reasoning support based on a
clear, principled semantics;
(3) interface with state-of-the-art coalgebraic and category theoretic
approaches to the semantics of programs and probabilistic inference to
understand and export shared features of key applications of reductive
reasoning like Facebook’s program verification tool Infer and the
machine-learning paradigm inductive logic programming.
We are looking for a student with an excellent first degree in mathematics,
computer science, philosophy, or another mathematical discipline, who has a
strong background and interest in logic. Ideally, candidates will also have an
excellent, relevant Master’s degree and strong programming skills.
For an informal discussion of the position, please contact David
(d@ucl.ac.uk), Alexandra (alexandra.si...@ucl.ac.uk), or Simon
(simon.docherty...@ucl.ac.uk).
To apply, please follow the instructions at
http://www.cs.ucl.ac.uk/prospective_students/phd_programme/funded_scholarships/
and indicate clearly on your application that you are applying for this
Scholarship ("A Coalgebraic framework for reductive logic and proof-search")
under the scholarships section, or in your personal statement.
--
Professor of Information, Logic, and Security
Head of Programming Principles, Logic, and Verification
University College London
Turing Fellow, The Alan Turing Institute, London
d@ucl.ac.uk
www.cs.ucl.ac.uk/people/D.Pym.html
www.cs.ucl.ac.uk/staff/D.Pym/
Assistant: Julia Savage, j.sav...@ucl.ac.uk, +44 (0)20 7679 0327
[TYPES/announce] Second School and Workshop on Univalent Mathematics, Birmingham (UK), April 1-5, 2019
[ The Types Forum (announcements only), http://lists.seas.upenn.edu/mailman/listinfo/types-announce ] Dear all, We are pleased to announce the Second School and Workshop on Univalent Mathematics, to be held at the University of Birmingham (UK), April 1-5, 2019 (https://unimath.github.io/bham2019) Overview Homotopy Type Theory is an emerging field of mathematics that studies a fruitful relationship between homotopy theory and (dependent) type theory. This relation plays a crucial role in Voevodsky's program of Univalent Foundations, a new approach to foundations of mathematics based on ideas from homotopy theory, such as the Univalence Principle. The UniMath library is a large repository of computer-checked mathematics, developed from the univalent viewpoint. It is based on the computer proof assistant Coq. In this school and workshop, we aim to introduce newcomers to the ideas of Univalent Foundations and mathematics therein, and to formalizing mathematics in a computer proof assistant based on Univalent Foundations. Format === We will have two tracks: - Beginners track - Advanced track: suitable for participants with some experience in Univalent Foundations and the proof assistant Coq. In the beginners track, you will receive an introduction to Univalent Foundations and to mathematics in those foundations, by leading experts in the field. In the accompanying problem sessions, you will formalize pieces of univalent mathematics in the UniMath library. In the advanced track, you will work, in a small group, on formalizing a specific topic in UniMath, guided by an expert in univalent mathematics. Your code will become part of the UniMath library. Application and funding === For information on how to participate, please visit https://unimath.github.io/bham2019. The deadline to apply is January 15, 2019. Limited financial support is available to cover participants' travel and lodging expenses. Mentors == Benedikt Ahrens (University of Birmingham) Thorsten Altenkirch (University of Nottingham) Langston Barrett (Galois, Inc.) Andrej Bauer (University of Ljubljana) Auke Booij (University of Birmingham) Martín Escardó (University of Birmingham) Tom de Jong (University of Birmingham) Marco Maggesi (University of Florence) Ralph Matthes (CNRS, University Toulouse) Anders Mörtberg (Carnegie Mellon University and University of Gothenburg) Niels van der Weide (University of Nijmegen) Best regards, The organizers Benedikt Ahrens and Marco Maggesi
[TYPES/announce] 10 PhD studentships in Nottingham
[ The Types Forum (announcements only), http://lists.seas.upenn.edu/mailman/listinfo/types-announce ] Dear all, The School of Computer Science at the University of Nottingham is seeking applications for 10 fully-funded PhD studentships: https://tinyurl.com/10-phds-2019 Applicants in the area of the Functional Programming Laboratory (https://tinyurl.com/fp-notts) are strongly encouraged! If you are interested in applying, please contact a potential supervisor at least two weeks prior to the 18th January deadline: Thorsten Altenkirch - constructive logic, proof assistants, homotopy type theory, category theory, lambda calculus. Venanzio Capretta - type theory, mathematical logic, corecursive structures, proof assistants, category theory, epistemic logic. Graham Hutton - functional programming, program calculation and transformation, correctness and efficiency, category theory. Henrik Nilsson - functional reactive programming, modelling and simulation, domain-specific languages, probabilistic languages. Best wishes, Graham +---+ 10 Fully-Funded PhD Studentships School of Computer Science University of Nottingham, UK https://tinyurl.com/10-phds-2019 Applications are invited for up to ten fully-funded PhD studentships in the School of Computer Science at the University of Nottingham, starting on 1 October 2019. The topics for the studentships are open, but should relate to one of the School’s research groups: Agents Lab; Automated Scheduling and Planning; Computer Vision Lab; Data Driven Algorithms, Systems and Design; Functional Programming Lab; Intelligent Modelling and Analysis; Uncertainty in Data and Decision Making; Mixed Reality Lab. The studentships are for a minimum of three years and include a stipend of £14,777 per year and tuition fees. They are open to students of any nationality. Applicants are normally expected to have a first-class MSc or BSc in Computer Science or a related discipline, and must obtain the support of a supervisor in the School prior to submitting their application. Initial contact with supervisors should be made at least two weeks prior to the closing date for applications. Informal enquiries may be addressed to ss-pgr...@nottingham.ac.uk. To apply, please submit the following items by email to: christine.fletc...@nottingham.ac.uk: (1) a brief covering letter that describes your reasons for wishing to pursue a PhD, your proposed research area and topic, and the name of the potential supervisor whose support you have already secured; (2) a copy of your CV, including your actual or expected degree classes, and results of all University examinations; (3) an extended example of your technical writing, such as a project report or dissertation; (4) contact details for two academic referees. Closing date for applications: Friday 18 January 2019 +---+ This message and any attachment are intended solely for the addressee and may contain confidential information. If you have received this message in error, please contact the sender and delete the email and attachment. Any views or opinions expressed by the author of this email do not necessarily reflect the views of the University of Nottingham. Email communications with the University of Nottingham may be monitored where permitted by law.
