Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page
Demo Data from EDBT 2026 / reviewers in the wild / expert

Daniel Castle

dblp:59/1251 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2024
0009-0000-3333-8161ORCID · reported

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Software engineering, system software, and programming languages
1 paper
Programming languages and type systems · 100%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Programming languages and type systems
lambda calculus		 0.812024
The Relational Machine Calculus · LICS 2024
Programming languages and type systems › language semantics › formal semantics
operational semantics		 0.812024
The Relational Machine Calculus · LICS 2024
Programming languages and type systems › logic programming
relational programming		 0.812024
The Relational Machine Calculus · LICS 2024

Methods — techniques the papers use, named apart from their topics

sequencing · 0.8locations · 0.8
YearPublicationVenuePosition
2024 The Relational Machine Calculus
abstract
This paper presents the Relational Machine Calculus (RMC): a simple, foundational model of first-order relational programming. The RMC originates from the Functional Machine Calculus (FMC), which generalizes the lambda-calculus and its standard call-by-name stack machine in two directions. One, "locations", introduces multiple stacks, which enable effect operators to be encoded into the abstraction and application constructs. The second, "sequencing", introduces the imperative notions of "skip" and "sequence", similar to kappa-calculus and concatenative programming languages.
Daniel Castle, Willem Heijltjes
 LICS2