Casper Bach Poulsen

Orcid: 0000-0003-0622-7639

Affiliations:
  • Delft University of Technology, The Netherlands
  • Swansea University, UK (PhD)


According to our database1, Casper Bach Poulsen authored at least 24 papers between 2013 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
Hefty Algebras: Modular Elaboration of Higher-Order Algebraic Effects.
Proc. ACM Program. Lang., January, 2023

Types and Semantics for Extensible Data Types (Extended Version).
CoRR, 2023

A Monadic Framework for Name Resolution in Multi-phased Type Checkers.
Proceedings of the 22nd ACM SIGPLAN International Conference on Generative Programming: Concepts and Experiences, 2023

Verifying Well-Typedness Preservation of Refactorings using Scope Graphs.
Proceedings of the 25th ACM International Workshop on Formal Techniques for Java-like Programs, 2023

Renamingless Capture-Avoiding Substitution for Definitional Interpreters.
Proceedings of the Eelco Visser Commemorative Symposium, 2023

Types and Semantics for Extensible Data Types.
Proceedings of the Programming Languages and Systems - 21st Asian Symposium, 2023

2022
Intrinsically-typed definitional interpreters à la carte.
Proc. ACM Program. Lang., 2022

Language-parametric static semantic code completion.
Proc. ACM Program. Lang., 2022

Handling Higher-Order Effects.
CoRR, 2022

Towards a Language for Defining Reusable Programming Language Components - (Project Paper).
Proceedings of the Trends in Functional Programming - 23rd International Symposium, 2022

2021
Latent Effects for Reusable Language Components: Extended Version.
CoRR, 2021

Latent Effects for Reusable Language Components.
Proceedings of the Programming Languages and Systems - 19th Asian Symposium, 2021

2020
Knowing when to ask: sound scheduling of name resolution in type checkers derived from declarative specifications.
Proc. ACM Program. Lang., 2020

Intrinsically-typed definitional interpreters for linear, session-typed languages.
Proceedings of the 9th ACM SIGPLAN International Conference on Certified Programs and Proofs, 2020

2019
From definitional interpreter to symbolic executor.
Proceedings of the 4th ACM SIGPLAN International Workshop on Meta-Programming Techniques and Reflection, 2019

2018
Intrinsically-typed definitional interpreters for imperative languages.
Proc. ACM Program. Lang., 2018

Compositional soundness proofs of abstract interpreters.
Proc. ACM Program. Lang., 2018

Scopes as types.
Proc. ACM Program. Lang., 2018

2017
Flag-based big-step semantics.
J. Log. Algebraic Methods Program., 2017

2016
Scopes Describe Frames: A Uniform Model for Memory Layout in Dynamic Semantics (Artifact).
Dagstuhl Artifacts Ser., 2016

Scopes Describe Frames: A Uniform Model for Memory Layout in Dynamic Semantics.
Proceedings of the 30th European Conference on Object-Oriented Programming, 2016

2015
Imperative Polymorphism by Store-Based Types as Abstract Interpretations.
Proceedings of the 2015 Workshop on Partial Evaluation and Program Manipulation, 2015

2014
Deriving Pretty-Big-Step Semantics from Small-Step Semantics.
Proceedings of the Programming Languages and Systems, 2014

2013
Generating Specialized Interpreters for Modular Structural Operational Semantics.
Proceedings of the Logic-Based Program Synthesis and Transformation, 2013


  Loading...