Cover Image

Have a thing? Reasoning around recursion with dynamic typing in grounded arithmetic

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Bobrow, Elliot, Ford, Bryan, Milenkovic, Stefan
Format:	Preprint
Published:	2025
Subjects:	Programming Languages Formal Languages and Automata Theory Logic in Computer Science Logic F.3.1; F.4.1
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Satisfiability of Context-free String Constraints with Subword-ordering and Transducers
by: Aiswarya, C, et al.
Published: (2024)

Model-Checking PCTL Properties of Stateless Probabilistic Pushdown Systems
by: Lin, Deren, et al.
Published: (2014)

Inquisitive Team Semantics of LTL
by: Bozzelli, Laura, et al.
Published: (2025)

Orbit-finite linear programming
by: Ghosh, Arka, et al.
Published: (2023)

A Nivat Theorem for Weighted Alternating Automata over Commutative Semirings
by: Grabolle, Gustav
Published: (2022)

INTERLEAVE: A Faster Symbolic Algorithm for Maximal End Component Decomposition
by: Bansal, Suguman, et al.
Published: (2025)

A Theory of Hanoi Omega-Automata and Games
by: Filiot, Emmanuel, et al.
Published: (2026)

Characterizing NC1 with Typed Monoids
by: Dawar, Anuj, et al.
Published: (2025)

Succinctness of Cosafety Fragments of LTL via Combinatorial Proof Systems (extended version)
by: Geatti, Luca, et al.
Published: (2024)

Learning Deterministic One-Counter Automata in Polynomial Time
by: Mathew, Prince, et al.
Published: (2025)

Equivariant ideals of polynomials
by: Ghosh, Arka, et al.
Published: (2024)

Visualising CTL Witnesses and Counterexamples -- Extended Version
by: Rensink, Arend
Published: (2026)

From Compactifying Lambda-Letrec Terms to Recognizing Regular-Expression Processes
by: Grabmayer, Clemens
Published: (2024)

Openness And Partial Adjacency In One Variable TPTL
by: Krishna, Shankara Narayanan, et al.
Published: (2024)

Stratifiable formulae are not context-free
by: Ryan-Smith, Calliope
Published: (2023)

Finitely Presentable Higher-Dimensional Automata and the Irrationality of Process Replication
by: Basold, Henning, et al.
Published: (2023)

How Concise are Chains of co-Büchi Automata?
by: Ehlers, Rüdiger
Published: (2025)

A Decision Procedure for Probabilistic Kleene Algebra with Angelic Nondeterminism
by: Ong, Shawn, et al.
Published: (2025)

Scalable Learning of One-Counter Automata via State-Merging Algorithms
by: Guha, Shibashis, et al.
Published: (2025)

Rabin Games and Colourful Universal Trees
by: Majumdar, Rupak, et al.
Published: (2024)

Edit Distance of Finite-Valued Transducers
by: Mathew, Prince, et al.
Published: (2026)

Edit Distance of Finite State Transducers
by: Aiswarya, C., et al.
Published: (2024)

PVASS Reachability is Decidable
by: Guttenberg, Roland, et al.
Published: (2025)

Reachability and Related Problems in Vector Addition Systems with Nested Zero Tests
by: Guttenberg, Roland, et al.
Published: (2025)

Model-bounded monitoring of hybrid systems
by: Waga, Masaki, et al.
Published: (2021)

Verifying Tree-Manipulating Programs via CHCs
by: Faella, Marco, et al.
Published: (2025)

Flavors of Quantifiers in Hyperlogics
by: Chalupa, Marek, et al.
Published: (2025)

Quantitative Verification of Omega-regular Properties in Probabilistic Programming
by: Wang, Peixin, et al.
Published: (2025)

A Logic For Fresh Labelled Transition Systems
by: Bandukara, Mohamed H, et al.
Published: (2025)

Introducing Divergence for Infinite Probabilistic Models
by: Finkel, Alain, et al.
Published: (2023)

Generically Automating Separation Logic by Functors, Homomorphisms and Modules
by: Xu, Qiyuan, et al.
Published: (2024)

Probability and Angelic Nondeterminism with Multiset Semantics
by: Ong, Shawn, et al.
Published: (2024)

Propositional dynamic logic and asynchronous cascade decompositions for regular trace languages
by: Adsul, Bharat, et al.
Published: (2024)

Quantitative Assurance and Synthesis of Controllers from Activity Diagrams
by: Ye, Kangfeng, et al.
Published: (2024)

On Some Complexity Results for Even Linear Languages
by: Cojocaru, Liliana
Published: (2024)

Parameterized Verification of Disjunctive Timed Networks
by: André, Étienne, et al.
Published: (2023)

Dynamically Reprogrammable Runtime Monitors for Bounded-time MTL
by: Hebballi, Chirantan, et al.
Published: (2026)

The complexity of downward closures of indexed languages
by: Mandel, Richard, et al.
Published: (2026)

Extending the Quantitative Pattern-Matching Paradigm
by: Alves, Sandra, et al.
Published: (2024)

Non-reducible Modal Transition Systems
by: Basile, Davide
Published: (2023)