Cover Image

Intrinsic Verification of Parsers and Formal Grammar Theory in Dependent Lambek Calculus (Extended Version)

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Schaefer, Steven, Varner, Nathan, de Amorim, Pedro H. Azevedo, New, Max S.
Format:	Preprint
Published:	2025
Subjects:	Programming Languages Formal Languages and Automata Theory F.3.2; F.4.2
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Parsing Hypergraphs using Context-Free Positional Grammars
by: Costagliola, Gennaro, et al.
Published: (2026)

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

Various Types of Comet Languages and their Application in External Contextual Grammars
by: Ködding, Marvin, et al.
Published: (2024)

Techniques for Showing the Decidability of the Boundedness Problem of Language Acceptors
by: Ibarra, Oscar H., et al.
Published: (2024)

A New Graph Grammar Formalism for Robust Syntactic Pattern Recognition
by: Fletcher, Peter
Published: (2025)

Well-Quasi-Orderings on Word Languages
by: Lhote, Nathan, et al.
Published: (2025)

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

Around Context-Free Grammars -- a Normal Form, a Representation Theorem, and a Regular Approximation
by: Cojocaru, Liliana
Published: (2015)

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

Inferring Input Grammars from Code with Symbolic Parsing
by: Bettscheider, Leon, et al.
Published: (2025)

Inversion by Partial Evaluation: A Reversible Interpreter Experiment
by: Glück, Robert, et al.
Published: (2024)

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

Anti-Context-Free languages
by: Cardó, Carles
Published: (2024)

Walking on Words
by: Pratt-Hartmann, Ian
Published: (2022)

Parameterized Verification of Timed Networks with Clock Invariants
by: André, Étienne, et al.
Published: (2024)

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

On Graph Grammars and Games
by: Vijayakumar, Jayakrishna, et al.
Published: (2024)

The Generation-Recognition Asymmetry: Six Dimensions of a Fundamental Divide in Formal Language Theory
by: Peyrichou, Romain
Published: (2026)

Black-box Context-free Grammar Inference for Readable & Natural Grammars
by: Arefin, Mohammad Rifat, et al.
Published: (2025)

Tilt Automata: Gathering Particles With Uniform External Control
by: Fekete, Sándor P., et al.
Published: (2026)

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

How to Demonstrate Metalinearness and Regularity by Tree-Restricted General Grammars
by: Havel, Martin, et al.
Published: (2024)

On a Generalization of the Christoffel Tree: Epichristoffel Trees
by: Krishnamoorthy, Abhishek, et al.
Published: (2025)

Formal Modeling and Verification of Grover's Algorithm
by: Sun, H., et al.
Published: (2026)

Implementation of Polynomial NP-Complete Algorithms Based on the NP Verifier Simulation Framework
by: Lee, Changryeol
Published: (2026)

Active Automata Learning with Advice
by: Fica, Michał, et al.
Published: (2025)

Learning Tree Automata with Term Rewriting
by: Kopystiański, Jakub, et al.
Published: (2026)

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

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

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

Jump Complexity of Deterministic Finite Automata with Translucent Letters
by: Fazekas, Szilárd Zsolt, et al.
Published: (2025)

Computing Maximal Repeating Subsequences in a String
by: Gong, Mingyang, et al.
Published: (2026)

Subsequence Matching and Analysis Problems for Formal Languages
by: Fazekas, Szilárd Zsolt, et al.
Published: (2024)

Disproving Termination of Non-Erasing Sole Combinatory Calculus with Tree Automata (Full Version)
by: Nakano, Keisuke, et al.
Published: (2024)

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

Construction of Minkowski Sums by Cellular Automata
by: Tahay, Pierre-Adrien
Published: (2024)

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

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

The CFG Complexity of Singleton Sets
by: Fortnow, Lance, et al.
Published: (2024)

Attractor Basins in Concurrent Systems
by: Samboni, Giann Karlo Aguirre, et al.
Published: (2024)