Registered user since Tue 9 Dec 2014
L. Thomas van Binsbergen is a PhD student in Computer Science at Royal Holloway University of London, and an MSc graduate of Utrecht University.
His work revolves around specifying and prototyping programming languages. He contributed to the Utrecht University Attribute Grammar Compiler (UUAGC) in 2014, implementing algorithms for compile-time scheduling of attribute evaluation based on dependency analysis.
As an affiliate to the PLanCompS project he has developed Haskell tools for defining and executing FunCons: highly reusable and modular components used in the formal specification of programming languages’ semantics. For more information visit http://plancomps.org
General interest in Computer Science: Teaching, Programming Languages, Algorithm Design, Soundness & Correctness Proofs, Graph Theory and Complexity Analysis, Genetic Programming and Program Synthesis
Particular aspects related to “Software Languages and their Specification”:
- Language design and formal semantics
- Generating interpreters based on the formal semantics of a language
- Computational effects: Modelling abnormal control flow like exceptions, and side-effects like Input/Output and variable assignment in pure maths
- Static analysis of programs: type-checkers, sanity-checkers, program manipulation
- Reusable components for both syntax and semantics of languages.
Interests in Computer Science Education:
- Improving the understandability of algorithms by explaining the algorithm at the right level of abstraction, removing unnecessary detail, breaking down algorithms into their core components and defining those components as pure and composable functions
- Tutoring systems for the analysis of student solutions and automated feedback
|PEPM 2018||Checking Cryptographic API Usage with Composable Annotations (Short Paper)|
|Show activities from other conferences|
View general profile