Welcome to my personal website!
About Me
Hello! I’m a Colombian researcher and explorer from the capital city Bogotá.
With over seven years of experience as a research engineer, I have developed a
diverse skill set specializing in mathematical conceptualization, research, and
product development across various technologies and domains. Currently, I am
working as a research engineer at Heliax AG on the Anoma
specification, an Actorlike model theory for
Anoma, and the Anoma research topics index. Before
this, I was a compiler engineer and product lead also at Heliax AG, working on
the Juvix programming language and related compiler
projects for Anoma. Prior to that, I was enrolled in a PhD
program at the University of Bergen, Norway, where I worked
on graphtheoretical constructions in homotopy type theory. I have a master’s
degree in Applied Mathematics from Universidad EAFIT, Colombia, where I worked
on proofreconstruction in type theory, and I have a bachelor’s degree in
Mathematics from Universidad Sergio Arboleda, Colombia, where I worked on
elliptic curves.
Keywords: Formal methods, type theory, logic, algorithms, graph theory, category
theory, functional programming, proofassistant, univalent mathematics.
Work Experience
Research & Development Engineer, Heliax AG
 Jan 2023  Present. Remote.
 Specification & Anoma Research Topics’ Editor
Compiler Engineer & Product Lead, Heliax AG
 Mar 2022  Dec 2023. Remote.
 Juvix Programming Language and Related Compiler Stack Projects
Previous Work Experience
Researcher, Heliax AG
 Aug 2021  Mar 2022. Remote.
As Compiler Team Member (parttime), I contributed with the following talks:
 Twolevel type theory for metaprogramming. 2022. PLT seminar.
 Termination checker strategies. 2022. PLT seminar.
 An internalist approach to correctbyconstruction compilers. 2021. PLT seminar.
 Bidirectional type checking algorithms. 2021. PLT seminar.
 HoTT day in Berlin. 2021. PLT seminar.
 Typechecking for STLC in Agda. 2021. PLT seminar.
 20182021. Bergen, Norway.
 Master courses: Models of Computation, Concurrent Programming, Introduction to Logic, Software Engineering
Young Research Assistant, Department of Mathematics, Universidad EAFIT
Lecturer, Instituto Tecnológico Metropolitano
 July 2016  Dec 2016. Medellín, Colombia.
 Undergraduate courses: Linear Algebra, Linear Programming, and Algebra
Machine Learning Engineer, Observatorio de Tierras
 2014  2016. Bogotá, Colombia.
 Developed ML algorithms and text data mining tools.
Lecturer, Universidad Sergio
 20122014. Bogotá, Colombia.
 Undergraduate courses: Algorithms III, Discrete Mathematics
Fullstack Python Developer, Vanitech
 2012Bogotá, Colombia.
 Developed the booking platform and landing page.
Software Developer, Scripta Software
 2009Bogotá, Colombia.
 Implemented the RSA algorithm for a C# .NET API to serve encryption/decryption services integrated into a financial tool.
Education

PhD in Computer Science, Informatics, ICT Research Group, University of Bergen

2018  2023. Bergen, Norway. Thesis submitted.

Thesis title: Investigations on GraphTheoretical Constructions in Homotopy
Type Theory.

Supervisors: Håkon R. Gylterud and Marc Bezem.

Interests: type theory, logic, algorithms, graph theory, category theory

About
My PhD research is situated within the field of constructive
mathematics
and specifically, the study of mathematical constructions within the
framework of Homotopy type theory. This
relatively recent type theory is particularly noteworthy due to its
mathematical interpretation and its structural principles. Arguably, type
theories can be
defined as formal systems
and also as functional programming
languages.
From this perspective, there is no distinction between the process of
proving mathematical
statements and programming on a computer, facilitating the assessment of
the correctness of mathematical statements.
Keywords: dependent type
theory,
homotopy type theory,
agda, functional
programming,
proofassistant,
univalence axiom,
univalent mathematics

M.Sc. in Applied Mathematics  Logic and Algorithms, School of Sciences, Universidad EAFIT

B.Sc. in Mathematics, Faculty of Engineering, Universidad Sergio Arboleda
 2007  2013. Bogotá, Colombia.
 Thesis title: Introduction to Elliptic Curves
 Supervisor: Hermés Martínez.
Other universities I have attended:
 Universidad Nacional de Colombia (20092013)  Economics & Systems
Engineering  Bogotá, Colombia. Dropout.
Summer Schools/Conferences
 Midlands Graduate School (MGS) in Cyberspace, 1216 April 2021.
 UiB ICT Ph.D Forum
in Voss, Norway, 26 October, 2020.
 HoTT Summer School in
Pittsburgh, USA, August. 2019.
 TYPES 2019 in Oslo, Norway,
June. 2019.
 Midlands Graduate School (MGS) at University of
Birmingham, UK, April, 2019.
 EUTypes Summer School in
Ohrid, Macedonia, 812 August, 2018.
 Agda Implementors’ Meeting XXVII
in Gothenburg, Sweden, 49 June, 2018.
 Agda Implementors’ Meeting XXV
in Gothenburg, Sweden, 915 May, 2017.
Seminar talks
 Investigations on graphtheoretical constructions in HoTT. Univalent
Foundations
For Daily Application (UFFDA), 1819 November 2021, Bergen, Norway. (PDF)
 Automatic Theorem Proving, an act of trust. ICT Ph.D
Forum, 2627 October 2020, Voss, Norway,
 Planar Graphs in Univalent Mathematics. TYPES
2019 in Oslo, Norway, 11
June. 2019.
(PDF)
 Pathovers, An Introduction to Dependent Type Theory. Lafayette Topology
Seminar
, 14 December 2018, Lafayette, USA.
 Proofreconstruction in Agda. Agda Implementors' Meeting
XXV
915 May 2017, Gothenburg, Sweden.
As a member of the Logic and Computation group at Universidad EAFIT, I presented the following talks:
 Proofreconstruction in Agda. 2017. Logic and Computation group seminar, Universidad EAFIT.
 Model checking with Alloy. June 20, 2017. Universidad EAFIT.
 Simple typed lambda calculus. 2017. Universidad EAFIT.
 Kripke semantics. Logic and Computation group seminar, 2016.
Universidad EAFIT.
Publications
 Prieto‐Cubides, Jonathan and Håkon Robbestad Gylterud (2024). On planarity of graphs in homotopy type theory. Mathematical Structures in Computer Science, pp. 1–41. DOI: 10.1017/S0960129524000100.

 (2024). Artefact: Mechanised proofs in Agda for the manuscript “Investigations into Graph‐theoretical Constructions in Homotopy Type Theory”. DOI: 10.5281/zenodo.11092174.
 – (2022). On Homotopy of Walks and Spherical Maps in Homotopy Type Theory. In: Proceedings of the 11th ACM SIGPLAN International Conference on Certified Programs and Proofs. CPP 2022. Philadelphia, PA, USA: Association for Computing Machinery, pp. 338–351. DOI: 10.1145/3497775.3503671.
 Prieto‐Cubides, Jonathan and Camilo Argoty (2018). Dealing with Missing Data using a Selection Algorithm on Rough Sets. International Journal of Computational Intelligence Systems 11.1, p. 1307. DOI: 10.2991/ijcis.11.1.97.
 Prieto‐Cubides, Jonathan (2017). Proof‐Reconstruction in Type Theory for Propositional Logic. Master’s Thesis. DOI: http://doi.org/10.5281/zenodo.1127672.
Music
When teenage, I played the guitar and enjoyed listing to Thrash and Power metal.
Nowadays, I can listen to almost any genre, mostly by friend’s recommendations,
including rap, hiphop, and classical music.
Hobbies
When not working, I enjoy chess, and video games. I also like to do nothing every once in a while.
Other Stuff
Archived Software projects
 athena: a proofreconstruction
implementation in type theory for the propositional logic fragment of the automatic theorem prover Metis. (Haskell)
(PDF).
 onlineatps:
a commandline tool to use popular automatic theorem provers.
 agdametis: a
formalisation of the propositional fragment in
Metis
.
 agdaprop: a deep
embedding specification of classical propositional logic in
Agda
.
 proppack: a collection of
TPTP
problems
and TSTP
solutions of problems in classical logic to test automatic provers.
 agdapkg: a simple example of a packagemanager for
Agda
.
 hottcheatsheets: a
collection of homotopy type theory cheatsheets with the content of the HoTT
Book.
 arsi: a selection algorithm on rough sets for missing data in databases.
 poirot: a text search, a package, and analysis platform programmed
in
Mathematica
, designed for retrieval, analysis and
systematization of large textual data (in the order of tens of
thousands of files). Poirot is tailored for the needs of qualitative
researchers, journalists, and state officials (in the judiciary, for
example), that need to find specific textual bits in big masses of
unstructured text. This development was part of a larger project by
Observatorio de Restitución de
Tierras and Universidad
Sergio Arboleda, both Colombian research organizations. Therefore,
the source code is private, but if you are interested in, you can
contact me.
Some no academicrelated opensource projects:
 flaskponywhoosh: a
Flask
fulltext search engine.
 ponywoosh: a
Python
package to make fulltext searchable Pony
databases.
 pythonatxt: a tool to extract text data from different kind of files. Available upon request.
 dig: a web scrapper with a nice GUI. Available upon request.
Community initiatives
 ICFP 2024 Artifact Evaluation Committee
 A reading group on PL topics by graduate students and friends at
UiB. See theuibcoworkers.
 Organizer and problem setter for a few programming contests at
Universidad Sergio Arboleda.
 Quantum computing seminar for undergrads at Universidad Sergio
Arboleda
Short Notes
For more detailed information, please refer to my full CV.
Jonathan PrietoCubides's website