Determinization of inverted grammar programs via context-free expressions

DOI10.1016/J.JLAMP.2021.100688MaRDI QIDQ1979968zbMATH OpenOpenAlexFDO

Authors Naoki Nishida, Minami Niwa

Publication date 3 September 2021

Published in Journal of Logical and Algebraic Methods in Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jlamp.2021.100688

zbMATH Keywords

context-free grammarterm rewritingregular expressionprogram inversion

Mathematics Subject Classification ID

Computer science (68-XX)

Recommendations

• Improving determinization of grammar programs for program inversion
• Functional and Logic Programming
• A method for automatic program inversion based on LR(0) parsing
• A grammar-based approach to invertible programs
• scientific article; zbMATH DE number 3858392

Cites work

• scientific article; zbMATH DE number 1729952 (Why is no real title available?)
• scientific article; zbMATH DE number 3740740 (Why is no real title available?)
• scientific article; zbMATH DE number 408802 (Why is no real title available?)
• scientific article; zbMATH DE number 1502115 (Why is no real title available?)
• scientific article; zbMATH DE number 1889386 (Why is no real title available?)
• A grammar-based approach to invertible programs
• A method for automatic program inversion based on LR(0) parsing
• A program inverter for a functional language with equality and constructors.
• Automated termination proofs for logic programs by term rewriting
• Automatic Partial Inversion of Inductively Sequential Functions
• Coalgebraic characterizations of context-free languages
• Completion after program inversion of injective functions
• Computing more specific versions of conditional rewriting systems
• Determinization of conditional term rewriting systems
• Improving determinization of grammar programs for program inversion
• Operational termination of conditional term rewriting systems
• Program inversion for tail recursive functions
• Program inversion: More than fun!
• Rewriting extended regular expressions
• Sound generalizations in mathematical induction
• Soundness of unravelings for conditional term rewriting systems via ultra-properties related to linearity
• Term Rewriting and Applications

Describes a project that uses

Uses Software

• LRinv

This page was built for publication: Determinization of inverted grammar programs via context-free expressions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1979968)