Cover Image

Inversion by Partial Evaluation: A Reversible Interpreter Experiment

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Glück, Robert, Normann, Louis Marott
Format:	Preprint
Published:	2024
Subjects:	Programming Languages Formal Languages and Automata Theory D.3.4; F.1.1; F.3.2
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

LR Parsing of Permutation Phrases
by: Kostičová, Jana
Published: (2024)

Towards Automatic Error Recovery in Parsing Expression
by: de Medeiros, Sérgio Queiroz, et al.
Published: (2025)

On some Classes of Reversible 2-head Automata
by: Nagy, Benedek, et al.
Published: (2025)

Intrinsic Verification of Parsers and Formal Grammar Theory in Dependent Lambek Calculus (Extended Version)
by: Schaefer, Steven, et al.
Published: (2025)

On Repetitive Finite Automata with Translucent Words
by: Mráz, František, et al.
Published: (2025)

On the Boolean Closure of Deterministic Top-Down Tree Automata
by: Löding, Christof, et al.
Published: (2024)

On Minimization and Learning of Deterministic $ω$-Automata in the Presence of Don't Care Words
by: Löding, Christof, et al.
Published: (2022)

Recognizing Numbers
by: Gaba, Pranshu, et al.
Published: (2025)

Lexicographic transductions of finite words
by: Filiot, Emmanuel, et al.
Published: (2025)

Probabilistic Finite Automaton Emptiness is undecidable
by: Rote, Günter
Published: (2024)

Orbit-Finite-Dimensional Vector Spaces and Weighted Register Automata
by: Bojańczyk, Mikołaj, et al.
Published: (2021)

Probabilistic Finite Automaton Emptiness is Undecidable for a Fixed Automaton
by: Rote, Günter
Published: (2024)

Identity Testing for Stochastic Languages
by: Agarwal, Smayan, et al.
Published: (2025)

Turn Complexity of Context-free Languages, Pushdown Automata and One-Counter Automata
by: Pighizzini, Giovanni
Published: (2026)

Geometric Characterization of Context-Free Intersections via the Inner Segment Dichotomy
by: Silva, Jorge Miguel
Published: (2026)

Exploring Complexity: An Extended Study of Formal Properties for Process Model Complexity Measures
by: Schalk, Patrizia, et al.
Published: (2024)

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

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

A Uniform Framework for Problems on Context-Free Grammars
by: Esparza, Javier, et al.
Published: (2024)

Regular Expressions with Backreferences: Polynomial-Time Matching Techniques
by: Schmid, Markus L.
Published: (2019)

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

Learning real-time one-counter automata using polynomially many queries
by: Mathew, Prince, et al.
Published: (2024)

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

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

On Transition Constructions for Automata -- A Categorical Perspective
by: Cruchten, Mike
Published: (2024)

Polynomial Complementation of Nondeterministic 2-Way Finite Automata by 1-Limited Automata
by: Guillon, Bruno, et al.
Published: (2025)

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

Kleene Theorems for Lasso Languages and $ω$-Languages
by: Cruchten, Mike
Published: (2024)

Input-Erasing Two-Way Finite Automata
by: Meduna, Alexander, et al.
Published: (2025)

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

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

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

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)

Difficulty Generating Factors for Context-free Language Construction Assignments
by: Schmalstieg, Florian, et al.
Published: (2025)

The Inclusion Depth of Pattern Languages: An Open Problem in Algorithmic Learning Theory
by: Luo, Wei
Published: (2026)

Complex Event Recognition with Symbolic Register Transducers: Extended Technical Report
by: Alevizos, Elias, et al.
Published: (2024)

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

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

FSM Builder: A Tool for Writing Autograded Finite Automata Questions
by: Robson, Eliot Wong, et al.
Published: (2024)