Oskar Abrahamsson

Orcid: 0000-0002-4861-2650

According to our database1, Oskar Abrahamsson authored at least 9 papers between 2017 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Cakes That Bake Cakes: Dynamic Computation in CakeML.
Proc. ACM Program. Lang., 2023

PureCake: A Verified Compiler for a Lazy Functional Language.
Proc. ACM Program. Lang., 2023

Fast, Verified Computation for Candle.
Proceedings of the 14th International Conference on Interactive Theorem Proving, 2023

2022
Candle: A Verified Implementation of HOL Light.
Proceedings of the 13th International Conference on Interactive Theorem Proving, 2022

2020
A verified proof checker for higher-order logic.
J. Log. Algebraic Methods Program., 2020

Proof-Producing Synthesis of CakeML from Monadic HOL Functions.
J. Autom. Reason., 2020

2019
Verified compilation on a verified processor.
Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation, 2019

2018
Proof-Producing Synthesis of CakeML with I/O and Local State from Monadic HOL Functions.
Proceedings of the Automated Reasoning - 9th International Joint Conference, 2018

2017
Automatically Introducing Tail Recursion in CakeML.
Proceedings of the Trends in Functional Programming - 18th International Symposium, 2017


  Loading...