Automata, Languages and Programming

DOI10.1007/b99859zbMath1099.68769OpenAlexW2505584480MaRDI QIDQ5466499

Luca Cardelli, Alain Frisch

Publication date: 24 August 2005

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b99859

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Formal languages and automata (68Q45) Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19)

Related Items

PiDuce- A project for experimenting web services technologies ⋮ A Computational Interpretation of Context-Free Expressions ⋮ From Ambiguous Regular Expressions to Deterministic Parsing Automata ⋮ On the Semantics of Regular Expression Parsing in the Wild ⋮ BSP: A Parsing Tool for Ambiguous Regular Expressions ⋮ POSIX lexing with derivatives of regular expressions ⋮ Translating regular expression matching into transducers ⋮ Formalising and implementing Boost POSIX regular expression matching ⋮ Unnamed Item ⋮ A deterministic parsing algorithm for ambiguous regular expressions ⋮ Disambiguation in Regular Expression Matching via Position Automata with Augmented Transitions ⋮ Hedge Pattern Partial Derivative ⋮ From Regular Expression Matching to Parsing ⋮ POSIX Lexing with Derivatives of Regular Expressions (Proof Pearl) ⋮ Derivative-Based Diagnosis of Regular Expression Ambiguity ⋮ Adapting functional programs to higher order logic ⋮ Annotated regular expressions and input-driven languages ⋮ From regular expression matching to parsing ⋮ Proof-directed program transformation: A functional account of efficient regular expression matching ⋮ On the semantics of regular expression parsing in the wild