Cover Image

The Relational Machine Calculus

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Barrett, Chris, Castle, Daniel, Heijltjes, Willem
Format:	Preprint
Published:	2024
Subjects:	Programming Languages 03B70 D.3.1; D.3.2; F.4.1; F.1.1; I.2.3
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Modelling Distributed Applications with Mixed-Choice Stateful Typestates
by: Parrinha, Francisco, et al.
Published: (2026)

Node Replication: Theory And Practice
by: Kesner, Delia, et al.
Published: (2022)

Alpay Algebra II: Identity as Fixed-Point Emergence in Categorical Data
by: Alpay, Faruk
Published: (2025)

Closure Conversion, Flat Environments, and the Complexity of Abstract Machines
by: Accattoli, Beniamino, et al.
Published: (2025)

Gradual Guarantee via Step-Indexed Logical Relations in Agda
by: Siek, Jeremy G.
Published: (2024)

Compile-Time Tensor Shape Checking via Staged Shape-Dependent Types
by: Suwa, Takashi, et al.
Published: (2026)

Genericity Through Stratification
by: Arrial, Victor, et al.
Published: (2024)

AdapTT: Functoriality for Dependent Type Casts
by: Adjedj, Arthur, et al.
Published: (2025)

Definitional Functoriality for Dependent (Sub)Types -- Extended version
by: Laurent, Théo, et al.
Published: (2023)

What does it take to certify a conversion checker?
by: Lennon-Bertrand, Meven
Published: (2025)

A foundational characterization of Hoare Logic
by: Leivant, Daniel
Published: (2026)

Verified VCG and Verified Compiler for Dafny
by: Nezamabadi, Daniel, et al.
Published: (2025)

Separation Logic of Generic Resources via Sheafeology
by: van Starkenburg, Berend, et al.
Published: (2025)

Summa Summarum: Moessner's Theorem without Dynamic Programming
by: Danvy, Olivier
Published: (2024)

Qurts: Automatic Quantum Uncomputation by Affine Types with Lifetime
by: Hirata, Kengo, et al.
Published: (2024)

Explicit Weakening
by: Wadler, Philip
Published: (2024)

TensorRight: Automated Verification of Tensor Graph Rewrites
by: Arora, Jai, et al.
Published: (2025)

Extracting total Amb programs from proofs
by: Berger, Ulrich, et al.
Published: (2023)

Polymorphic Bottom-Up Weighted Relational Programming
by: Volkov, Dmitri
Published: (2026)

Gödel Mirror: A Formal System For Contradiction-Driven Recursion
by: Chan, Jhet
Published: (2025)

The logic of bunched implications is undecidable
by: Galatos, Nick, et al.
Published: (2026)

Committing to the bit: Relational programming with semiring arrays and SAT solving
by: Volkov, Dmitri, et al.
Published: (2025)

HpC: A Calculus for Hybrid and Mobile Systems -- Full Version
by: Xu, Xiong, et al.
Published: (2025)

BinSub: The Simple Essence of Polymorphic Type Inference for Machine Code
by: Smith, Ian
Published: (2024)

Nominal techniques as an Agda library
by: Gabbay, Murdoch J., et al.
Published: (2026)

Weak Memory Model Formalisms: Introduction and Survey
by: Su, Roger C., et al.
Published: (2025)

Complete Robust Hybrid Systems Reachability
by: Wafa, Noah Abou El, et al.
Published: (2026)

Globality and Regions
by: Gramaglia, Hector
Published: (2025)

Simple Modal Types for Functional Reactive Programming
by: Bahr, Patrick
Published: (2025)

Practical Algebraic Stepping with Scoped Filters
by: Fei, Haoxiang, et al.
Published: (2026)

Scoped and Typed Staging by Evaluation
by: Allais, Guillaume
Published: (2023)

Approximate Axiomatization for Differentially-Defined Functions
by: Platzer, André, et al.
Published: (2025)

A Rust-to-Lean Verification Pipeline with AI Provers: An Experience Report
by: Klaus, Natalia, et al.
Published: (2026)

Towards a unified framework for programming paradigms: A systematic review of classification formalisms and methodological foundations
by: Vandeloise, Mikel
Published: (2025)

Stratified Type Theory
by: Chan, Jonathan, et al.
Published: (2023)

What if we have 90 minutes only to teach programming?
by: Egri-Nagy, Attila
Published: (2026)

Hoare meets Heisenberg: A Lightweight Logic for Quantum Programs
by: Sundaram, Aarthi, et al.
Published: (2021)

Axiomatization of Compact Initial Value Problems: Open Properties
by: Platzer, André, et al.
Published: (2024)

Unified Fairness for Weak Memory Verification
by: Abdulla, Parosh Aziz, et al.
Published: (2023)

Intent-Driven Computing: A Computational Model for Governed Autonomous Systems
by: McCann, Alan L.
Published: (2026)