What is he best known for?
The fields of study he is best known for:
- Programming language
- Algebra
- Artificial intelligence
Lars Birkedal mainly focuses on Programming language, Separation logic, Theoretical computer science, Type theory and Concurrency.
His Programming language study integrates concerns from other disciplines, such as Logical consequence and Mathematical proof.
Lars Birkedal has included themes like Commutative property, Proof assistant, Higher-order logic and Concurrent data structure, Data structure in his Separation logic study.
His Theoretical computer science study combines topics in areas such as Algorithm, Correctness and Axiomatic semantics.
His research in Type theory tackles topics such as Hoare logic which are related to areas like Boolean algebra and Type.
His work in Concurrency addresses subjects such as Thread, which are connected to disciplines such as Linearizability, Semantic data model and Heap.
His most cited work include:
- Iris: Monoids and Invariants as an Orthogonal Basis for Concurrent Reasoning (148 citations)
- Ynot: dependent types for imperative programs (141 citations)
- From region inference to von Neumann machines via region representation inference (128 citations)
What are the main themes of his work throughout his whole career to date?
His primary areas of investigation include Programming language, Theoretical computer science, Separation logic, Type theory and Algebra.
His Programming language course of study focuses on Mathematical proof and Soundness.
His Theoretical computer science study combines topics from a wide range of disciplines, such as Algorithm, Semantics and Reactive system.
The Algorithm study which covers Standard ML that intersects with Partial evaluation.
His research on Separation logic also deals with topics like
- Concurrency which intersects with area such as Modular design,
- Hoare logic that intertwine with fields like Axiomatic semantics.
The Type theory study combines topics in areas such as Decidability, Fixed point, Calculus and Extensionality.
He most often published in these fields:
- Programming language (39.20%)
- Theoretical computer science (32.16%)
- Separation logic (32.16%)
What were the highlights of his more recent work (between 2017-2021)?
- Separation logic (32.16%)
- Programming language (39.20%)
- Concurrency (11.56%)
In recent papers he was focusing on the following fields of study:
His main research concerns Separation logic, Programming language, Concurrency, Mathematical proof and Calling convention.
His Separation logic research includes themes of Proof assistant, Monotonic function, Order and Modular design.
Lars Birkedal performs integrative study on Programming language and Logical relations.
His Concurrency research integrates issues from Property and Type.
His study focuses on the intersection of Mathematical proof and fields such as Soundness with connections in the field of Scala, State, Theoretical computer science and Generalization.
Lars Birkedal works mostly in the field of Theoretical computer science, limiting it down to concerns involving Basis and, occasionally, Type theory.
Between 2017 and 2021, his most popular works were:
- Iris from the Ground up: A modular Foundation for Higher-order Concurrent Separation Logic (99 citations)
- StkTokens: enforcing well-bracketed control flow and stack encapsulation using linear capabilities (20 citations)
- ReLoC: A Mechanised Relational Logic for Fine-Grained Concurrency (16 citations)
In his most recent research, the most cited papers focused on:
- Programming language
- Algebra
- Artificial intelligence
Lars Birkedal spends much of his time researching Distributed computing, Type theory, Proof assistant, Separation logic and Programming language.
His work carried out in the field of Distributed computing brings together such families of science as Correctness and Calling convention.
His Type theory study also includes
- Axiom and related Calculus, Modal logic, Recursion, Semantics and Adjunction,
- Operator which intersects with area such as Pure mathematics, Basis, Theoretical computer science and Completeness.
The study incorporates disciplines such as Concurrency and Modular design in addition to Separation logic.
His study explores the link between Concurrency and topics such as Soundness that cross with problems in State, Modularity and Mathematical proof.
He conducted interdisciplinary study in his works that combined Programming language and Logical relations.
This overview was generated by a machine learning system which analysed the scientist’s
body of work. If you have any feedback, you can
contact us
here.
